The following pages link to (Q3548359):
Displayed 48 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- Generating maps on surfaces (Q517449) (← links)
- Generating spherical Eulerian triangulations (Q966008) (← links)
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds (Q1041614) (← links)
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (Q1657010) (← links)
- Models of random knots (Q1659256) (← links)
- The evolution of random graphs on surfaces (Q1689942) (← links)
- Polyhedra with few 3-cuts are Hamiltonian (Q1732035) (← links)
- Generating simple convex Venn diagrams (Q1932372) (← links)
- Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions (Q1947986) (← links)
- Packing twelve spherical caps to maximize tangencies (Q2016417) (← links)
- Basic nets in the projective plane (Q2017449) (← links)
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails (Q2065902) (← links)
- \(Q_4\)-irreducible even triangulations of the projective plane (Q2065909) (← links)
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions (Q2105863) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Dissecting the square into seven or nine congruent parts (Q2113351) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- Symmetry break in the eight bubble compaction (Q2167582) (← links)
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
- The graphs behind reuleaux polyhedra (Q2207609) (← links)
- Highly-connected planar cubic graphs with few or many Hamilton cycles (Q2329193) (← links)
- Kempe-locking configurations (Q2337272) (← links)
- Growth rate of canonical and minimal group embeddings of spherical Latin trades (Q2434884) (← links)
- Topological designs (Q2439346) (← links)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (Q2825481) (← links)
- Recursive Generation of 5-Regular Planar Graphs (Q3605492) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- The Evolution of Random Graphs on Surfaces (Q4610182) (← links)
- Verification of the Jones unknot conjecture up to 22 crossings (Q4634898) (← links)
- Generation of local symmetry-preserving operations on polyhedra (Q4988850) (← links)
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739) (← links)
- Eternal domination and clique covering (Q5054057) (← links)
- The minimality of the Georges–Kelmans graph (Q5070550) (← links)
- Surface embeddings of the Klein and the Möbius–Kantor graphs (Q5127414) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Types of triangle in Hamiltonian triangulations and an application to domination and k-walks (Q5217058) (← links)
- Hypohamiltonian Planar Cubic Graphs with Girth 5 (Q5272629) (← links)
- Generating unlabeled connected cubic planar graphs uniformly at random (Q5454357) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Planar hypohamiltonian oriented graphs (Q6057582) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- (Q6177586) (← links)
- <i>K</i><sub>2</sub>‐Hamiltonian graphs: II (Q6199383) (← links)
- A new note on 1-planar graphs with minimum degree 7 (Q6204300) (← links)