Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs

DOI10.1007/BF01139613zbMath0717.05034OpenAlexW2031776380MaRDI QIDQ753827

Oleg V. Borodin

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1007/bf01139613

zbMATH Keywords

Planar pseudographsweight of a face

Mathematics Subject Classification ID

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

Related Items (14)

Another tight description of faces in plane triangulations with minimum degree 4 ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ Minimal unavoidable sets of cycles in plane graphs ⋮ Light graphs in families of outerplanar graphs ⋮ Heights of minor faces in 3-polytopes ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ On Light Edges and Triangles in Planar Graphs of Minimum Degree Five ⋮ Tight description of faces of triangulations on the torus ⋮ More about the height of faces in 3-polytopes ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ Low minor faces in 3-polytopes ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ Tight description of faces in torus triangulations with minimum degree 5 ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7

Cites Work

• On acyclic colorings of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs