Generation of Triangulations of the Sphere
From MaRDI portal
Cited in
(25)- Lattices on tetrahedral partitions
- On the enumeration of polyhedra
- Irreducible triangulations of the once-punctured torus
- An upper bound on Wiener indices of maximal planar graphs
- Generating rooted triangulations without repetitions
- Continuous maps with the disjoint support property
- The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs
- Volumes of polyhedra inscribed in the unit sphere in E^3
- An experimental study on generating planar graphs
- Order nine MMIK graphs
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- The complement problem for linklessly embeddable graphs
- Proximity in triangulations and quadrangulations
- Polytopes, graphs, and complexes
- A theorem on graph embedding with a relation to hyperbolic volume
- Generation of 3-connected, planar line graphs
- Dips at small sizes for topological graph obstruction sets
- Numerical continuation and bifurcation for differential geometric PDEs
- On self-duality and unigraphicity for 3-polytopes
- GPU algorithm for enumerating PL spheres of Picard number 4: application to toric topology
- Connected domination in plane triangulations
- Lattices on simplicial partitions which are not simply connected
- Inductive definition of two restricted classes of triangulations
- Nonflexible polyhedra with a small number of vertices
This page was built for publication: Generation of Triangulations of the Sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5547291)
