plantri

MaRDI QIDQ22818swMATHFDO

Official website http://cs.anu.edu.au/~bdm/plantri/

Cited in

(only showing first 100 items - show all)

• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
• nauty
• FuiGui
• Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
• Models of random knots
• GrInvIn
• The evolution of random graphs on surfaces
• Symmetries of unlabelled planar triangulations
• Polyhedra with few 3-cuts are Hamiltonian
• The construction of cubic and quartic planar maps with prescribed face degrees
• House of Graphs
• PyDEC
• Generating simple convex Venn diagrams
• Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
• CirclePack
• KnotTheory
• Traces
• Packing twelve spherical caps to maximize tangencies
• Basic nets in the projective plane
• Searching for square-complementary graphs: complexity of recognition and further nonexistence results
• 4-connected polyhedra have at least a linear number of Hamiltonian cycles
• The existence of uniform hypergraphs for which the interpolation property of complete coloring fails
• \(Q_4\)-irreducible even triangulations of the projective plane
• 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
• Switching 3-edge-colorings of cubic graphs
• A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
• The graphs behind reuleaux polyhedra
• NEWGRAPH
• NJGRAF
• RACAH
• Enumeration of irreducible contact graphs on the sphere
• A note on the smallest connected non-traceable cubic bipartite planar graph
• Highly-connected planar cubic graphs with few or many Hamilton cycles
• Regular non-Hamiltonian polyhedral graphs
• Kempe-locking configurations
• The soft-collinear bootstrap: \(\mathcal{N} = {4}\) Yang-Mills amplitudes at six- and seven-loops
• Covering the sphere with equal circles
• Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
• Growth rate of canonical and minimal group embeddings of spherical Latin trades
• Topological designs
• An interstice relationship for flowers with four petals
• The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\)
• Planar Eulerian triangulations are equivalent to spherical Latin bitrades
• Generation of simple quadrangulations of the sphere
• Construction of planar triangulations with minimum degree 5
• Acyclically 4-colorable triangulations
• Mathchem
• Structural and computational results on platypus graphs
• Fullerene
• Fast generation of some classes of planar graphs
• GraphTheory
• On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
• Knot probabilities in random diagrams
• Surftri
• An experimental study on generating planar graphs
• Exceptional surgeries on alternating knots
• Library of Triangulations
• CaGe
• Buckygen
• Fast generation of planar graphs
• Recursive Generation of 5-Regular Planar Graphs
• Different moment-angle manifolds arising from two polytopes having the same bigraded Betti numbers
• ABCDEFG
• GENREG
• GenerateUHG
• snarkhunter
• GYutsis
• GenHypohamiltonian
• Exhaustive generation of `Mrs. Perkins's quilt' square dissections for low orders
• LibTW
• 2L_enum
• The strong thirteen spheres problem
• Improved bounds for hypo-Hamiltonian graphs
• The Evolution of Random Graphs on Surfaces
• Verification of the Jones unknot conjecture up to 22 crossings
• Generating 4-connected even triangulations on the sphere
• Extremal problems of circle packings on a sphere and irreducible contact graphs
• The delunification process and minimal diagrams
• Recursive generation of IPR fullerenes
• Generation of local symmetry-preserving operations on polyhedra
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Eternal domination and clique covering
• The minimality of the Georges-Kelmans graph
• scientific article; zbMATH DE number 7410923 (Why is no real title available?)
• Generating maps on surfaces
• Graphs with few Hamiltonian cycles
• Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
• GRADPART
• Systre
• Gavrog
• Hypohamiltonian planar cubic graphs with girth 5
• scientific article; zbMATH DE number 5255703 (Why is no real title available?)
• Topological phases: an expedition off lattice
• Graph6Java
• Area difference bounds for dissections of a square into an odd number of triangles
• On universal point sets for planar graphs
• A theorem on graph embedding with a relation to hyperbolic volume

This page was built for software: plantri