Light paths with an odd number of vertices in polyhedral maps

DOI10.1023/A:1022837727747zbMath1079.05502WikidataQ114113096 ScholiaQ114113096MaRDI QIDQ3366522

Stanlislav Jendroľ, Heinz-Juergen Voss

Publication date: 14 February 2006

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30584

zbMATH Keywords

embeddingsgraphspathpolyhedral 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 (1)

Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds

Cites Work

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

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