Note on 3-paths in plane graphs of girth 4

DOI10.1016/j.disc.2015.04.011zbMath1311.05042OpenAlexW324240651MaRDI QIDQ2344794

Roman Soták, Stanlislav Jendroľ, Mária Maceková

Publication date: 18 May 2015

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

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

zbMATH Keywords

girthplane graph3-pathstructural property

Mathematics Subject Classification ID

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

Related Items (17)

All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ 3-paths in graphs with bounded average degree ⋮ An analogue of Franklin's theorem ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Light 3-stars in sparse plane graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ An extension of Kotzig's theorem ⋮ 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 ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ Light graphs in planar graphs of large girth ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps

Cites Work

• Unnamed Item
• Unnamed Item
• Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Describing 3-paths in normal plane maps
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations
• Describing short paths in plane graphs of girth at least 5
• A structural property of convex 3-polytopes
• Light subgraphs of graphs embedded in the plane. A survey
• Colorings of plane graphs: a survey
• On the total coloring of planar graphs.
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Note on 3-paths in plane graphs of girth 4