A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

DOI10.4153/CJM-1974-065-6MaRDI QIDQ5666571zbMATH OpenFDO

Authors J. W. Butler

Publication date 1974

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1974-065-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cited in

(14)

• Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Construction of planar triangulations with minimum degree 5
• Generating \(r\)-regular graphs
• Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
• Cyclically five-connected cubic graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• Geometric biplane graphs. II: Graph augmentation
• Generating the \(c^*5\)-connected graphs
• The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs
• Generating closed 2-cell embeddings in the torus and the projective plane
• Recursive Generation of 5-Regular Planar Graphs
• Generating 5-regular planar graphs
• Theory of families of polytopes: fullerenes and Pogorelov polytopes

This page was built for publication: A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs

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