On generating planar graphs
From MaRDI portal
Publication:2264773
DOI10.1016/0012-365X(74)90035-1zbMath0273.05104MaRDI QIDQ2264773
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (23)
Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ Every simple 3-polytype with 34 vertices is Hamiltonian ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Cyclically five-connected cubic graphs ⋮ Generating the centrally symmetric 3-polyhedral graphs ⋮ Face extensions in planar cubic graphs ⋮ Generating \(r\)-regular graphs ⋮ An inductive definition of the class of 3-connected quadrangulations of the plane ⋮ Edge reductions in cyclically \(k\)-connected cubic graphs ⋮ Non removable edges in 3-connected cubic graphs ⋮ Distance-two colourings of Barnette graphs ⋮ Uniform cyclic edge connectivity in cubic graphs ⋮ Theory of families of polytopes: fullerenes and Pogorelov polytopes ⋮ Generating the \(c^*5\)-connected graphs ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ Generating closed 2-cell embeddings in the torus and the projective plane ⋮ Generating 5-regular planar graphs ⋮ The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs ⋮ Cohomological rigidity of families of manifolds associated with ideal right-angled hyperbolic 3-polytopes ⋮ Construction of planar triangulations with minimum degree 5 ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
Cites Work
This page was built for publication: On generating planar graphs
