All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)

DOI10.1016/j.disc.2018.08.026zbMath1397.05040OpenAlexW2890761766MaRDI QIDQ1800414

Anna O. Ivanova, Oleg V. Borodin

Publication date: 23 October 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.026

zbMATH Keywords

plane graph3-polytope3-pathstructural propertynormal plane map

Mathematics Subject Classification ID

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

Related Items (5)

All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6

Cites Work

• 3-paths in graphs with bounded average degree
• An analogue of Franklin's theorem
• Describing 3-paths in normal plane maps
• Describing short paths in plane graphs of girth at least 5
• Weight of 3-paths in sparse plane graphs
• Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
• A structural property of convex 3-polytopes
• Note on 3-paths in plane graphs of girth 4
• Describing tight descriptions of 3-paths in triangle-free normal plane maps
• Minimal vertex degree sum of a 3-path in plane maps
• Paths with restricted degrees of their vertices in planar graphs
• Tight Descriptions of 3‐Paths in Normal Plane Maps

This page was built for publication: All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)