On light graphs in 3-connected plane graphs without triangular or quadrangular faces

DOI10.1007/s003730170007zbMath0988.05031OpenAlexW2080337524MaRDI QIDQ5956103

Stanlislav Jendroľ, Peter J. Owens

Publication date: 24 June 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730170007

zbMATH Keywords

3-connected planar graphlight graph

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (7)

On the Decay of Crossing Numbers of Sparse Graphs ⋮ Minimal unavoidable sets of cycles in plane graphs ⋮ The structure of 1-planar graphs ⋮ Light graphs in planar graphs of large girth ⋮ On large light graphs in families of polyhedral graphs ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ On \(3\)-connected plane graphs without triangular faces

This page was built for publication: On light graphs in 3-connected plane graphs without triangular or quadrangular faces