swMATH10864MaRDI QIDQ22818FDOQ22818
Author name not available (Why is that?)
Official website: http://cs.anu.edu.au/~bdm/plantri/
Cited In (only showing first 100 items - show all)
- 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
- Exhaustive generation of `Mrs. Perkins's quilt' square dissections for low orders
- Acyclically 4-colorable triangulations
- Packing twelve spherical caps to maximize tangencies
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Enumeration of irreducible contact graphs on the sphere
- Exceptional surgeries on alternating knots
- 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
- 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
- Fast generation of planar graphs
- On universal point sets for planar graphs
- Irreducible Apollonian configurations and packings
- An enumeration of equilateral triangle dissections
- Topological designs
- Polyhedra with few 3-cuts are Hamiltonian
- FuiGui
- GrInvIn
- House of Graphs
- PyDEC
- Switching 3-edge-colorings of cubic graphs
- Generating 4-connected even triangulations on the sphere
- CirclePack
- KnotTheory
- Traces
- NEWGRAPH
- NJGRAF
- RACAH
- Mathchem
- Fullerene
- GraphTheory
- Surftri
- The Evolution of Random Graphs on Surfaces
- Library of Triangulations
- Buckygen
- CaGe
- ABCDEFG
- GENREG
- GenerateUHG
- GenHypohamiltonian
- GYutsis
- snarkhunter
- LibTW
- 2L_enum
- The graphs behind reuleaux polyhedra
- Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
- Gavrog
- GRADPART
- Systre
- Title not available (Why is that?)
- Graph6Java
- 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
- 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
- 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
- Improved bounds for hypo-Hamiltonian graphs
- A note on the smallest connected non-traceable cubic bipartite planar graph
- GPU ECC
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
- HexEx
- An interstice relationship for flowers with four petals
- Counting cliques in 1-planar graphs
- Dissecting the square into seven or nine congruent parts
- Area difference bounds for dissections of a square into an odd number of triangles
- Regular non-Hamiltonian polyhedral graphs
- Kempe-locking configurations
- Verification of the Jones unknot conjecture up to 22 crossings
- Basic nets in the projective plane
- Generation of local symmetry-preserving operations on polyhedra
- Graphs with few Hamiltonian cycles
- Searching for square-complementary graphs: complexity of recognition and further nonexistence results
- Title not available (Why is that?)
- A theorem on graph embedding with a relation to hyperbolic volume
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
This page was built for software: plantri
