On doubly light triangles in plane graphs
From MaRDI portal
Publication:383767
DOI10.1016/J.DISC.2012.11.018zbMATH Open1277.05047OpenAlexW2086706557MaRDI QIDQ383767FDOQ383767
Authors: Peter Hudák, Tomáš Madaras 
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
Recommendations
Cites Work
- Graph theory
- Structural theorem on plane graphs with application to the entire coloring number
- Joint extension of two theorems of Kotzig on 3-polytopes
- On light cycles in plane triangulations
- Title not available (Why is that?)
- Structural Properties of Planar Maps with the Minimal Degree 5
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Two variations of Franklin's theorem
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- On vertex-degree restricted paths in polyhedral graphs
- Heavy paths, light stars, and big melons
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- On doubly light vertices in plane graphs
- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- On light edges and triangles in projective planar graphs
- Title not available (Why is that?)
Cited In (11)
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- Light 3-faces of plane graphs without 6-cycles
- An analogue of Franklin's theorem
- On light graphs in 3-connected plane graphs without triangular or quadrangular faces
- Weight of 3-paths in sparse plane graphs
- On doubly light vertices in plane graphs
- Light triangles in plane graphs with near-independent crossings
- An extension of Kotzig's theorem
- Two variations of Franklin's theorem
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- Describing 4-paths in 3-polytopes with minimum degree 5
This page was built for publication: On doubly light triangles in plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383767)
