All tight descriptions of 3-paths in plane graphs with girth at least 9
From MaRDI portal
Publication:1615748
DOI10.17377/SEMI.2018.15.095zbMath1398.05067MaRDI QIDQ1615748
Oleg V. Borodin, Anna O. Ivanova, Valerii A. Aksenov
Publication date: 31 October 2018
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (5)
3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ 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 ⋮ 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
- 3-paths in graphs with bounded average degree
- 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
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- 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
- Joint extension of two theorems of Kotzig on 3-polytopes
- Quelques consequences simples de la formule d'Euler
- 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
- Tight Descriptions of 3‐Paths in Normal Plane Maps
- Unnamed Item
- Unnamed Item
This page was built for publication: All tight descriptions of 3-paths in plane graphs with girth at least 9
