On generating planar graphs

From MaRDI portal
Publication:2264773

DOI10.1016/0012-365X(74)90035-1zbMath0273.05104MaRDI QIDQ2264773

D. W. Barnette

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items (23)

Construction of acyclically 4-colourable planar triangulations with minimum degree 4Every simple 3-polytype with 34 vertices is HamiltonianConstruction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal faceCyclically five-connected cubic graphsGenerating the centrally symmetric 3-polyhedral graphsFace extensions in planar cubic graphsGenerating \(r\)-regular graphsAn inductive definition of the class of 3-connected quadrangulations of the planeEdge reductions in cyclically \(k\)-connected cubic graphsNon removable edges in 3-connected cubic graphsDistance-two colourings of Barnette graphsUniform cyclic edge connectivity in cubic graphsTheory of families of polytopes: fullerenes and Pogorelov polytopesGenerating the \(c^*5\)-connected graphsThree-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructionsGenerating closed 2-cell embeddings in the torus and the projective planeGenerating 5-regular planar graphsThe spanning maximal planar subgraph problem for some classes of complete 4-partite graphsCohomological rigidity of families of manifolds associated with ideal right-angled hyperbolic 3-polytopesConstruction of planar triangulations with minimum degree 5Geometric biplane graphs. I: Maximal graphsGeometric biplane graphs. II: Graph augmentationGenerating 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