On large light graphs in families of polyhedral graphs

DOI10.1016/J.DISC.2009.03.008zbMath1216.05123OpenAlexW2008595123MaRDI QIDQ960946

Róbert Hajduk, Roman Soták

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

zbMATH Keywords

light graphplane graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (1)

Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight

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

This page was built for publication: On large light graphs in families of polyhedral graphs