On vertex-degree restricted paths in polyhedral graphs

DOI10.1016/S0012-365X(99)00209-5zbMath0946.05047MaRDI QIDQ1970577

Igor Fabrici, Hansjoachim Walther, Erhard Hexel, Stanlislav Jendroľ

Publication date: 18 October 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

paths\( k \)-connected planar graphssubgraphs with restricted degrees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

Heavy paths, light stars, and big melons ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ Four gravity results ⋮ The structure of 1-planar graphs ⋮ Light graphs in families of outerplanar graphs ⋮ The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 ⋮ On doubly light triangles in plane graphs ⋮ On large light graphs in families of polyhedral graphs ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Unnamed Item ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ On light cycles in plane triangulations

This page was built for publication: On vertex-degree restricted paths in polyhedral graphs