All tight descriptions of 3-paths in plane graphs with girth at least 7
From MaRDI portal
Publication:2659247
DOI10.1016/j.disc.2021.112335zbMath1460.05048OpenAlexW3129472824MaRDI QIDQ2659247
Anna O. Ivanova, Oleg V. Borodin
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112335
Related Items (1)
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
- An introduction to the discharging method via graph coloring
- Describing 4-paths in 3-polytopes with minimum degree 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 tight descriptions of 3-paths in plane graphs with girth at least 9
- 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
- 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
- Note on 3-paths in plane graphs of girth 4
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- Joint extension of two theorems of Kotzig on 3-polytopes
- Minimal vertex degree sum of a 3-path in plane maps
- On light subgraphs in plane graphs of minimum degree five
- 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 tight descriptions of 3-paths in plane graphs with girth at least 7
