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