Akempic triangulations with 4 odd vertices

DOI10.1016/0012-365X(85)90059-7zbMATH Open0572.05026OpenAlexW2002309870MaRDI QIDQ1062068FDOQ1062068

Authors: 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

Recommendations

• Acyclically 4-colorable triangulations
• 4-connected triangulations on few lines
• 4-connected triangulations on few lines
• Acute triangles in 4-connected maximal plane graphs
• Four-connected triangulations of planar point sets
• The enumeration of akempic triangulations
• 4-connected triangulations and 4-orderedness
• A Four Vertex Theorem for Polygons
• Triangulating graphs with few \(P_4\)'s
• Planar 4-critical graphs with four triangles

zbMATH Keywords

triangulationsgraph coloringKempe interchange

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Isomorphisms and automorphisms of graph coverings
• Kempe equivalence of 4‐critical planar graphs
• Graph covering projections arising from finite vector spaces over finite fields
• Strengthening a Theorem of Meyniel
• The enumeration of akempic triangulations
• Simplicial schemes

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

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