Generating the c^*5-connected graphs

DOI10.1007/BF02759790zbMATH Open0377.05018OpenAlexW1999992729MaRDI QIDQ1246541FDOQ1246541

Authors: 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)

Cites Work

• Title not available (Why is that?)
• On generating planar graphs
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246541)