On \(3\)-connected plane graphs without triangular faces

DOI10.1006/jctb.1999.1918zbMath1027.05030OpenAlexW1979962634MaRDI QIDQ1569046

Stanlislav Jendroľ, Michal Tkáč, Jochen Harant

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1918

zbMATH Keywords

pathEuler characteristicstriangle-free graphplanar graphspanning subgraph2-dimensional manifold

Mathematics Subject Classification ID

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

Related Items (12)

Paths with restricted degrees of their vertices in planar graphs ⋮ Heavy paths, light stars, and big melons ⋮ Four gravity results ⋮ The structure of 1-planar graphs ⋮ The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 ⋮ A Dirac theorem for trestles ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ 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 ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On light cycles in plane triangulations
• 2-connected spanning subgraphs of planar 3-connected graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• A structural property of convex 3-polytopes
• Subgraphs with restricted degrees of their vertices in planar graphs
• A local property of large polyhedral maps on compact 2-dimensional manifolds
• On vertex-degree restricted paths in polyhedral graphs
• Minimal vertex degree sum of a 3-path in plane maps
• On light subgraphs in plane graphs of minimum degree five
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Trees in Polyhedral Graphs
• Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
• On light graphs in 3-connected plane graphs without triangular or quadrangular faces

This page was built for publication: On \(3\)-connected plane graphs without triangular faces