Tight Descriptions of 3‐Paths in Normal Plane Maps
From MaRDI portal
Publication:5272637
DOI10.1002/jgt.22051zbMath1365.05150OpenAlexW2423909866WikidataQ121093848 ScholiaQ121093848MaRDI QIDQ5272637
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Publication date: 30 June 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22051
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items
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, A tight description of 3-polytopes by their major 3-paths, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
- Describing 3-paths in normal plane maps
- Describing faces in plane triangulations
- Describing short paths in plane graphs of girth at least 5
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- A structural property of convex 3-polytopes
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: 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
