Akempic triangulations with 4 odd vertices

DOI10.1016/0012-365X(85)90059-7zbMath0572.05026OpenAlexW2002309870MaRDI QIDQ1062068

Bojan Mohar

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90059-7

zbMATH Keywords

graph coloringtriangulationsKempe interchange

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Graph covering projections arising from finite vector spaces over finite fields ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Strengthening a Theorem of Meyniel ⋮ Isomorphisms and automorphisms of graph coverings ⋮ The enumeration of akempic triangulations ⋮ Simplicial schemes

Cites Work

• Geometric coloring theory
• Generating all graph coverings by permutation voltage assignments

This page was built for publication: Akempic triangulations with 4 odd vertices