Planar Eulerian triangulations are equivalent to spherical Latin bitrades

DOI10.1016/J.JCTA.2007.04.002MaRDI QIDQ2469205zbMATH OpenOpenAlexFDO

Authors Petr Lisoněk, Nicholas J. Cavenagh

Publication date 4 February 2008

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2007.04.002

zbMATH Keywords

Eulerian triangulationisomorph-free generationLatin bitradeSteiner triple trade

Mathematics Subject Classification ID

Triple systems (05B07) Orthogonal arrays, Latin squares, Room squares (05B15) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Near-homogeneous spherical Latin bitrades
• An enumeration of spherical latin bitrades
• Minimal and minimum size latin bitrades of each genus.
• Latin trades in groups defined on planar triangulations
• Generating spherical Eulerian triangulations

Cites work

• A computer enumeration of small Latin trades
• A course in combinatorics.
• Graphs on surfaces
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• Hamming distances of groups and quasi-groups
• scientific article; zbMATH DE number 3724488 (Why is no real title available?)
• scientific article; zbMATH DE number 15463 (Why is no real title available?)
• scientific article; zbMATH DE number 4187820 (Why is no real title available?)

Cited in

(12)

• Latin trades in groups defined on planar triangulations
• Subcubic trades in Steiner triple systems
• Growth rate of canonical and minimal group embeddings of spherical Latin trades
• Minimal and minimum size latin bitrades of each genus.
• The theory and application of latin bitrades: A survey
• Latin bitrades, dissections of equilateral triangles, and abelian groups
• Generating 4-connected even triangulations on the sphere
• Geometrical structure and construction of latin trades
• Near-homogeneous spherical Latin bitrades
• A computer enumeration of small Latin trades
• An enumeration of equilateral triangle dissections
• Generating spherical Eulerian triangulations

Describes a project that uses

Uses Software

• plantri

This page was built for publication: Planar Eulerian triangulations are equivalent to spherical Latin bitrades

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469205)