On doubly light triangles in plane graphs
From MaRDI portal
Publication:383767
DOI10.1016/j.disc.2012.11.018zbMath1277.05047MaRDI QIDQ383767
Publication date: 6 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.018
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
An analogue of Franklin's theorem, An extension of Kotzig's theorem, All tight descriptions of 3-stars in 3-polytopes with girth 5, Describing 4-paths in 3-polytopes with minimum degree 5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- On light cycles in plane triangulations
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- Heavy paths, light stars, and big melons
- On vertex-degree restricted paths in polyhedral graphs
- Joint extension of two theorems of Kotzig on 3-polytopes
- On doubly light vertices in plane graphs
- Structural Properties of Planar Maps with the Minimal Degree 5
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
- On light subgraphs in plane graphs of minimum degree five
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- On the structure of plane graphs of minimum face size 5
- Structural theorem on plane graphs with application to the entire coloring number
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- On light edges and triangles in projective planar graphs
