On large light graphs in families of polyhedral graphs
From MaRDI portal
Publication:960946
DOI10.1016/j.disc.2009.03.008zbMath1216.05123MaRDI QIDQ960946
Publication date: 29 March 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.008
05C75: Structural characterization of families of graphs
Related Items
Cites Work
- Unnamed Item
- On light cycles in plane triangulations
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- On \(3\)-connected plane graphs without triangular faces
- Heavy paths, light stars, and big melons
- Light subgraphs of graphs embedded in the plane. A survey
- On vertex-degree restricted paths in polyhedral graphs
- 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
- On light graphs in 3-connected plane graphs without triangular or quadrangular faces