Light paths with an odd number of vertices in large polyhedral maps

DOI10.1007/BF01608528zbMath0929.05049OpenAlexW3023519220WikidataQ114233942 ScholiaQ114233942MaRDI QIDQ1293420

Stanlislav Jendroľ, Heinz-Juergen Voss

Publication date: 25 October 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01608528

zbMATH Keywords

surfaceEuler characteristictorusembeddingspathKlein bottlegenuspolyhedral map

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light paths with an odd number of vertices in polyhedral maps ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Kotzig's theorem
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• A local property of large polyhedral maps on compact 2-dimensional manifolds
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges

This page was built for publication: Light paths with an odd number of vertices in large polyhedral maps