Fast generation of planar graphs
From MaRDI portal
Publication:3548359
zbMATH Open1164.68025MaRDI QIDQ3548359FDOQ3548359
Authors: Gunnar Brinkmann 
Publication date: 11 December 2008
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cited In (59)
- Domination of triangulated discs and maximal outerplanar graphs
- Robust topological construction of all-hexahedral boundary layer meshes
- Graph coloring and semidefinite rank
- Existential closure in line graphs
- K2‐Hamiltonian graphs: II
- A new note on 1-planar graphs with minimum degree 7
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
- The characterization of \(( n- 1)\)-spheres with \(n+ 4\) vertices having maximal Buchstaber number
- The evolution of random graphs on surfaces
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- Construction of planar triangulations with minimum degree 5
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
- Acyclically 4-colorable triangulations
- Packing twelve spherical caps to maximize tangencies
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Counting cliques in 1-planar graphs
- Dissecting the square into seven or nine congruent parts
- Planar hypohamiltonian oriented graphs
- Highly-connected planar cubic graphs with few or many Hamilton cycles
- Kempe-locking configurations
- Title not available (Why is that?)
- Verification of the Jones unknot conjecture up to 22 crossings
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Recursive generation of simple planar 5-regular graphs and pentangulations
- Basic nets in the projective plane
- Generation of local symmetry-preserving operations on polyhedra
- Quasipolynomiality of the Smallest Missing Induced Subgraph
- Graphs with few Hamiltonian cycles
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
- Topological designs
- Polyhedra with few 3-cuts are Hamiltonian
- Switching 3-edge-colorings of cubic graphs
- The Evolution of Random Graphs on Surfaces
- The graphs behind reuleaux polyhedra
- Graph coloring and semidefinite rank
- Symmetry break in the eight bubble compaction
- Complex psd-minimal polytopes in dimensions two and three
- Generating spherical Eulerian triangulations
- Hypohamiltonian planar cubic graphs with girth 5
- Growth rate of canonical and minimal group embeddings of spherical Latin trades
- Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
- Eternal domination and clique covering
- Models of random knots
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
- Generating unlabeled connected cubic planar graphs uniformly at random
- \(Q_4\)-irreducible even triangulations of the projective plane
- Generating simple convex Venn diagrams
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
- Recursive generation of IPR fullerenes
- Structural and computational results on platypus graphs
- Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
- Constant Time Generation of Biconnected Rooted Plane Graphs
- An experimental study on generating planar graphs
- Fast generation of some classes of planar graphs
- Generating maps on surfaces
- Recursive Generation of 5-Regular Planar Graphs
- Surface embeddings of the Klein and the Möbius–Kantor graphs
- Improved bounds for hypo-Hamiltonian graphs
- The minimality of the Georges-Kelmans graph
Uses Software
This page was built for publication: Fast generation of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548359)
