Generating spherical Eulerian triangulations

DOI10.1016/j.disc.2009.12.023zbMath1230.05214OpenAlexW2036842591MaRDI QIDQ966008

Petr Lisoněk, Aleš Drápal

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.12.023

zbMATH Keywords

Latin bitradeinductive generationspherical Eulerian triangulation

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Generating 4-connected even triangulations on the sphere ⋮ A generating theorem of simple even triangulations with a finitizable set of reductions ⋮ \(Q_4\)-irreducible even triangulations of the projective plane

Uses Software

• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Planar Eulerian triangulations are equivalent to spherical Latin bitrades

This page was built for publication: Generating spherical Eulerian triangulations