Describing 3-paths in normal plane maps
From MaRDI portal
Publication:394206
DOI10.1016/j.disc.2013.08.018zbMath1280.05026OpenAlexW2086683112MaRDI QIDQ394206
Matthew P. Yancey, Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka
Publication date: 24 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.018
Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
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, 3-paths in graphs with bounded average degree, An analogue of Franklin's theorem, Light subgraphs in graphs with average degree at most four, Low 5-stars in normal plane maps with minimum degree 5, Light 3-stars in sparse plane graphs, Upper bounds for domination related parameters in graphs on surfaces, 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, Weight of 3-paths in sparse plane graphs, Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5, Optimal unavoidable sets of types of 3-paths for planar graphs of given girth, Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices, Light 3-paths in 3-polytopes without adjacent triangles, An extension of Franklin's theorem, Soft 3-stars in sparse plane graphs, Describing short paths in plane graphs of girth at least 5, 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, Note on 3-paths in plane graphs of girth 4, Describing tight descriptions of 3-paths in triangle-free normal plane maps, Tight Descriptions of 3‐Paths in Normal Plane Maps
Cites Work
- Unnamed Item
- Unnamed Item
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- 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
