Generating 4-connected even triangulations on the sphere
From MaRDI portal
Publication:468437
DOI10.1016/j.disc.2014.08.017zbMath1303.52010OpenAlexW1967729836MaRDI QIDQ468437
Naoki Matsumoto, Atsuhiro Nakamoto
Publication date: 7 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.017
sphere4-connectedcyclically 4-edge-connected cubic bipartite graphseven triangulationsgenerating theorem
Planar graphs; geometric and topological aspects of graph theory (05C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
\(N\)-flips in 4-connected even triangulations on the sphere ⋮ Generating even triangulations on the torus
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs
- Inductive definition of two restricted classes of triangulations
- Note on the irreducible triangulations of the Klein bottle
- Generating spherical Eulerian triangulations
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
- Generating triangulations on closed surfaces with minimum degree at least 4
- Irreducible triangulations of the Klein bottle
- A simpler construction of volume polynomials for a polyhedron
- Generating the triangulations of the projective plane
- Irreducible quadrangulations of the torus
- Planar Eulerian triangulations are equivalent to spherical Latin bitrades
- Generation of simple quadrangulations of the sphere
- Construction of planar triangulations with minimum degree 5
- Steinitz Theorems for Orthogonal Polyhedra
- Generating quadrangulations of surfaces with minimum degree at least 3
- Generating even triangulations of the projective plane
This page was built for publication: Generating 4-connected even triangulations on the sphere
