On generating planar graphs
From MaRDI portal
Cited in
(25)- Every simple 3-polytype with 34 vertices is Hamiltonian
- Non removable edges in 3-connected cubic graphs
- Uniform cyclic edge connectivity in cubic graphs
- Generating the \(c^*5\)-connected graphs
- Face extensions in planar cubic 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
- Generating the centrally symmetric 3-polyhedral graphs
- Theory of families of polytopes: fullerenes and Pogorelov polytopes
- 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
- Distance-two colourings of Barnette graphs
- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- Geometric biplane graphs. I: Maximal graphs
- Geometric biplane graphs. II: Graph augmentation
- Cyclically five-connected cubic graphs
- Construction of planar triangulations with minimum degree 5
- Generating 5-regular planar graphs
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- Cohomological rigidity of manifolds with torus actions. I
- Complete tripartite graphs with spanning maximal planar subgraphs
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
- An inductive definition of the class of 3-connected quadrangulations of the plane
- Edge reductions in cyclically \(k\)-connected cubic graphs
This page was built for publication: On generating planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264773)
