Remark on simple paths in quadrangular polyhedral graphs
نویسندگان
چکیده
منابع مشابه
Finding simple paths and cycles in graphs
We describe a novel method, the method of random colorings, for finding simple paths and cycles of a specified length k in a graph G = (V,E). Using small bias probability spaces and families of perfect hash functions we can derandomize the randomized algorithms obtained using this method and obtain deterministic algorithms that establish the following new results: • For every fixed k, deciding ...
متن کاملRemark on Polyhedral Cones a Remark on Polyhedral Cones from Packed Words and from Finite Topologies Darij Grinberg
Definition 0.2. For any two sets X and Y, let Map (X, Y) denote the set of all maps from X to Y. Define a K-vector space M by M = ⊕ n≥0 Map (Rn, K) (where each Map (Rn, K) becomes a K-vector space by pointwise addition and multiplication with scalars). We make M into a K-algebra, whose multiplication is defined as follows: For any n ∈ N, any m ∈ N, any f ∈ Map (Rn, K) and g ∈ Map (Rm, K), we de...
متن کاملQuadrangular embeddings of complete graphs∗
Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...
متن کاملGeneralized Source Shortest Paths on Polyhedral Surfaces
We present an algorithm for computing shortest paths and distances from a single generalized source (point, segment, polygonal chain or polygon) to any query point on a possibly non-convex polyhedral surface. The algorithm also handles the case in which polygonal chain or polygon obstacles on the polyhedral surface are allowed. Moreover, it easily extends to the case of several generalized sour...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1968
ISSN: 0528-2195
DOI: 10.21136/cpm.1968.108658