A triangulation of the plane is akempic if it has a 4-colouring C where any two adjacent triangles have the four vertices of the two triangles coloured with all four colours, and C cannot be changed to an essentially different 4-colouring by a Kempe interchange (i.e. the vertices of any two of the four colours span a connected subgraph). \textit{S. Fisk} [Adv. Math. 24, 298-340 (1977; Zbl 0358.05023)] proved that there are two families of akempic triangulations with exactly four vertices of degree 3 and all other vertices of degree 6, and he asked if there are more such graphs. This question is here answered in the affirmative, based on a characterization of duals of akempic triangulations using voltage graphs. In particular it is proved that the number of non-isomorphic such triangulations on 4n vertices tends to infinity with n. It is announced that an exact formula for their number will appear elsewhere.
- 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
- The enumeration of akempic triangulations
- Simplicial schemes
- Isomorphisms and automorphisms of graph coverings
- Graph covering projections arising from finite vector spaces over finite fields
- scientific article; zbMATH DE number 437484 (Why is no real title available?)
- Kempe equivalence of 4‐critical planar graphs
- Strengthening a Theorem of Meyniel
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)
