Generating 4-connected even triangulations on the sphere
DOI10.1016/J.DISC.2014.08.017zbMATH Open1303.52010OpenAlexW1967729836MaRDI QIDQ468437FDOQ468437
Authors: 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
Recommendations
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
- Generating spherical Eulerian triangulations
- Generating even triangulations on the torus
- \(N\)-flips in 4-connected even triangulations on the sphere
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
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)
Cites Work
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs
- Generation of simple quadrangulations of the sphere
- Irreducible triangulations of the Klein bottle
- Generating the triangulations of the projective plane
- Irreducible quadrangulations of the torus
- Generating quadrangulations of surfaces with minimum degree at least 3
- Title not available (Why is that?)
- Note on the irreducible triangulations of the Klein bottle
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
- Generating even triangulations of the projective plane
- Inductive definition of two restricted classes of triangulations
- A simpler construction of volume polynomials for a polyhedron
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
- Generating triangulations on closed surfaces with minimum degree at least 4
- Planar Eulerian triangulations are equivalent to spherical Latin bitrades
- Construction of planar triangulations with minimum degree 5
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating spherical Eulerian triangulations
Cited In (7)
- Generating even triangulations on the torus
- \(N\)-flips in 4-connected even triangulations on the sphere
- Generating spherical Eulerian triangulations
- Generating triangulations on closed surfaces with minimum degree at least 4
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- Construction of planar 4-connected triangulations
- Generation of simple quadrangulations of the sphere
Uses Software
This page was built for publication: Generating 4-connected even triangulations on the sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468437)
