Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
From MaRDI portal
Publication:393180
DOI10.1016/j.disc.2013.10.021zbMath1278.05080OpenAlexW1976620981MaRDI QIDQ393180
Anna O. Ivanova, Oleg V. Borodin, Alexandr V. Kostochka
Publication date: 16 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.021
Three-dimensional polytopes (52B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (5)
An analogue of Franklin's theorem ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ All tight descriptions of 3-stars in 3-polytopes with girth 5 ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- On acyclic colorings of planar graphs
- On light cycles in plane triangulations
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: a survey
- Structural Properties of Planar Maps with the Minimal Degree 5
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Structural theorem on plane graphs with application to the entire coloring number
This page was built for publication: Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
