Note on the weight of paths in plane triangulations of minimum degree 4 and 5

DOI10.7151/dmgt.1117zbMath0982.05043OpenAlexW2017222256MaRDI QIDQ2725181

Tomáš Madaras

Publication date: 24 March 2002

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1117

zbMATH Keywords

pathweightplane triangulation

Mathematics Subject Classification ID

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

Related Items (9)

All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ An analogue of Franklin's theorem ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ An extension of Franklin's theorem ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9

This page was built for publication: Note on the weight of paths in plane triangulations of minimum degree 4 and 5