A generating theorem of simple even triangulations with a finitizable set of reductions
DOI10.1016/j.disc.2017.06.018zbMath1372.51001OpenAlexW2735563195MaRDI QIDQ2012559
Publication date: 1 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.06.018
Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) General theory of linear incidence geometry and projective geometries (51A05) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Polychromatic 4-coloring of cubic even embeddings on the projective plane
- All 2-manifolds have finitely many minimal triangulations
- Inductive definition of two restricted classes of triangulations
- Note on the irreducible triangulations of the Klein bottle
- Irreducible triangulations of the torus
- Generating spherical Eulerian triangulations
- Irreducible triangulations are small
- Irreducible triangulations of the Klein bottle
- Generating the triangulations of the projective plane
- Systems of curves on surfaces
- \(N\)-flips in even triangulations on surfaces
- Note on irreducible triangulations of surfaces
- Generating even triangulations of the projective plane
This page was built for publication: A generating theorem of simple even triangulations with a finitizable set of reductions