On vertex-degree restricted paths in polyhedral graphs
From MaRDI portal
Publication:1970577
DOI10.1016/S0012-365X(99)00209-5zbMath0946.05047MaRDI QIDQ1970577
Igor Fabrici, Erhard Hexel, Stanlislav Jendroľ, Hansjoachim Walther
Publication date: 18 October 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Unnamed Item, 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 large light graphs in families of polyhedral graphs, Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight, On light cycles in plane triangulations, On \(3\)-connected plane graphs without triangular faces, Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds, Heavy paths, light stars, and big melons