Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
From MaRDI portal
Publication:898139
DOI10.1016/j.disc.2015.10.016zbMath1327.05081OpenAlexW2139259343MaRDI QIDQ898139
Roman Soták, Mickaël Montassier, Stanlislav Jendroľ, Mária Maceková
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.016
Related Items (11)
All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ Light subgraphs in graphs with average degree at most four ⋮ 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Light 3-stars in sparse plane graphs ⋮ 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 ⋮ Light graphs in planar graphs of large girth ⋮ Soft 3-stars in sparse plane graphs ⋮ 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 ⋮ Light 3-stars in embedded graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Colorings and girth of oriented planar graphs
- A structural property of convex 3-polytopes
- Light subgraphs of graphs embedded in the plane. A survey
- Note on 3-paths in plane graphs of girth 4
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Colouring vertices of plane graphs under restrictions given by faces
- On the total coloring of planar graphs.
- Tight Descriptions of 3‐Paths in Normal Plane Maps
This page was built for publication: Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
