Generating the \(c^*5\)-connected graphs

DOI10.1007/BF02759790zbMath0377.05018OpenAlexW1999992729MaRDI QIDQ1246541

D. W. Barnette

Publication date: 1977

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Generating the centrally symmetric 3-polyhedral graphs ⋮ Generating \(r\)-regular graphs ⋮ Non removable edges in 3-connected cubic graphs ⋮ Theory of families of polytopes: fullerenes and Pogorelov polytopes ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ Generating 5-regular planar graphs

Cites Work

• On generating planar graphs
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
• Unnamed Item

This page was built for publication: Generating the \(c^*5\)-connected graphs