scientific article
From MaRDI portal
Publication:3548359
zbMath1164.68025MaRDI QIDQ3548359
Publication date: 11 December 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graph algorithms (graph-theoretic aspects) (05C85) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Related Items
Acyclically 4-colorable triangulations ⋮ Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ Eternal domination and clique covering ⋮ Switching 3-edge-colorings of cubic graphs ⋮ The minimality of the Georges–Kelmans graph ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Models of random knots ⋮ Graph coloring and semidefinite rank ⋮ Structural and computational results on platypus graphs ⋮ Symmetry break in the eight bubble compaction ⋮ A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ Generating simple convex Venn diagrams ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Planar hypohamiltonian oriented graphs ⋮ The evolution of random graphs on surfaces ⋮ Complex psd-minimal polytopes in dimensions two and three ⋮ K2‐Hamiltonian graphs: II ⋮ A new note on 1-planar graphs with minimum degree 7 ⋮ Improved bounds for hypohamiltonian graphs ⋮ Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions ⋮ Growth rate of canonical and minimal group embeddings of spherical Latin trades ⋮ The graphs behind reuleaux polyhedra ⋮ The Evolution of Random Graphs on Surfaces ⋮ Topological designs ⋮ Surface embeddings of the Klein and the Möbius–Kantor graphs ⋮ Unnamed Item ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ Verification of the Jones unknot conjecture up to 22 crossings ⋮ Recursive generation of IPR fullerenes ⋮ Generating maps on surfaces ⋮ Generating spherical Eulerian triangulations ⋮ Packing twelve spherical caps to maximize tangencies ⋮ Basic nets in the projective plane ⋮ Recursive Generation of 5-Regular Planar Graphs ⋮ Generating unlabeled connected cubic planar graphs uniformly at random ⋮ Graphs with few hamiltonian cycles ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations ⋮ The existence of uniform hypergraphs for which the interpolation property of complete coloring fails ⋮ \(Q_4\)-irreducible even triangulations of the projective plane ⋮ Generation of local symmetry-preserving operations on polyhedra ⋮ Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds ⋮ Highly-connected planar cubic graphs with few or many Hamilton cycles ⋮ Kempe-locking configurations ⋮ The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions ⋮ Counting cliques in 1-planar graphs ⋮ Dissecting the square into seven or nine congruent parts ⋮ Hypohamiltonian Planar Cubic Graphs with Girth 5
Uses Software
This page was built for publication:
