plantri

swMATH10864MaRDI QIDQ22818FDOQ22818

Author name not available (Why is that?)

Cited In (77)

• A note on the smallest connected non-traceable cubic bipartite planar graph
• An interstice relationship for flowers with four petals
• Regular non-Hamiltonian polyhedral graphs
• An Experimental Study on Generating Planar Graphs
• Kempe-locking configurations
• Verification of the Jones unknot conjecture up to 22 crossings
• Generation of local symmetry-preserving operations on polyhedra
• Hypohamiltonian Planar Cubic Graphs with Girth 5
• Types of triangle in Hamiltonian triangulations and an application to domination and k-walks
• Title not available (Why is that?)
• A theorem on graph embedding with a relation to hyperbolic volume
• A theorem on graph embedding with a relation to hyperbolic volume
• Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles
• Recursive Generation of 5-Regular Planar Graphs
• Graphs with few hamiltonian cycles
• Planar Eulerian triangulations are equivalent to spherical Latin bitrades
• 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
• Title not available (Why is that?)
• Exhaustive generation of `Mrs. Perkins's quilt' square dissections for low orders
• 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
• Enumeration of irreducible contact graphs on the sphere
• Exceptional surgeries on alternating knots
• On Universal Point Sets for Planar Graphs
• Knot probabilities in random diagrams
• Highly-connected planar cubic graphs with few or many Hamilton cycles
• To be or not to be Yutsis: algorithms for the decision problem
• Topological phases: an expedition off lattice
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
• Basic nets in the projective plane
• Covering the sphere with equal circles
• The construction of cubic and quartic planar maps with prescribed face degrees
• A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
• Searching for square-complementary graphs: complexity of recognition and further nonexistence results
• Irreducible Apollonian configurations and packings
• An enumeration of equilateral triangle dissections
• Improved bounds for hypohamiltonian graphs
• Topological designs
• Polyhedra with few 3-cuts are Hamiltonian
• Switching 3-edge-colorings of cubic graphs
• Generating 4-connected even triangulations on the sphere
• 4-connected polyhedra have at least a linear number of Hamiltonian cycles
• The minimality of the Georges–Kelmans graph
• The Evolution of Random Graphs on Surfaces
• The graphs behind reuleaux polyhedra
• Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
• Title not available (Why is that?)
• Generating spherical Eulerian triangulations
• The strong thirteen spheres problem
• Growth rate of canonical and minimal group embeddings of spherical Latin trades
• Eternal domination and clique covering
• Models of random knots
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
• Extremal problems of circle packings on a sphere and irreducible contact graphs
• The delunification process and minimal diagrams
• \(Q_4\)-irreducible even triangulations of the projective plane
• Generating simple convex Venn diagrams
• The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\)
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Symmetries of unlabelled planar triangulations
• Recursive generation of IPR fullerenes
• Optimal packings of congruent circles on a square flat torus
• Generation of simple quadrangulations of the sphere
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
• Structural and computational results on platypus graphs
• The soft-collinear bootstrap: \(\mathcal{N} = {4}\) Yang-Mills amplitudes at six- and seven-loops
• Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
• Different moment-angle manifolds arising from two polytopes having the same bigraded Betti numbers
• Fast generation of some classes of planar graphs
• Generating maps on surfaces

This page was built for software: plantri