Describing tight descriptions of 3-paths in triangle-free normal plane maps
From MaRDI portal
Publication:2352059
DOI10.1016/j.disc.2015.05.006zbMath1314.05042OpenAlexW1013340464MaRDI QIDQ2352059
Oleg V. Borodin, Anna O. Ivanova
Publication date: 29 June 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.006
Related Items (16)
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 ⋮ An analogue of Franklin's theorem ⋮ Light subgraphs in graphs with average degree at most four ⋮ 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 ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ An extension of Franklin's theorem ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ 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 3-paths in normal plane maps
- A structural property of convex 3-polytopes
- Joint extension of two theorems of Kotzig on 3-polytopes
- On the total coloring of planar graphs.
- Minimal vertex degree sum of a 3-path in plane maps
- Paths with restricted degrees of their vertices in planar graphs
This page was built for publication: Describing tight descriptions of 3-paths in triangle-free normal plane maps
