A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
From MaRDI portal
Publication:5666571
DOI10.4153/CJM-1974-065-6zbMath0253.05111MaRDI QIDQ5666571
Publication date: 1974
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
57M15: Relations of low-dimensional topology with graph theory
Related Items
Construction of acyclically 4-colourable planar triangulations with minimum degree 4, Edge reductions in cyclically \(k\)-connected cubic graphs, Generating the \(c^*5\)-connected graphs, Generating \(r\)-regular graphs, Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face, Generating closed 2-cell embeddings in the torus and the projective plane, Theory of families of polytopes: fullerenes and Pogorelov polytopes, The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, Geometric biplane graphs. II: Graph augmentation, Cyclically five-connected cubic graphs, Construction of planar triangulations with minimum degree 5, Recursive Generation of 5-Regular Planar Graphs, Generating 5-regular planar graphs