All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
DOI10.33048/SEMI.2019.16.092zbMATH Open1429.05046OpenAlexW3015461327MaRDI QIDQ2334769FDOQ2334769
Authors: Oleg V. Borodin, Anna O. Ivanova 
Publication date: 7 November 2019
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2019.16.092
Recommendations
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- 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
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Tight descriptions of 3-paths in normal plane maps
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- 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
- Joint extension of two theorems of Kotzig on 3-polytopes
- 3-paths in graphs with bounded average degree
- On the total coloring of planar graphs.
- Describing 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- An analogue of Franklin's theorem
- Tight descriptions of 3-paths in normal plane maps
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- An introduction to the discharging method via graph coloring
- Describing 4-paths in 3-polytopes with minimum degree 5
- 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\)
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
Cited In (11)
- 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 9
- Describing short paths in plane graphs of girth at least 5
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of 3-paths in plane graphs with girth 8
- An extension of Franklin's theorem
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- All tight descriptions of 3-paths in plane graphs with girth at least 7
- Note on 3-paths in plane graphs of girth 4
- Independent bondage number of planar graphs with minimum degree at least 3
This page was built for publication: All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334769)
