English: Simultaneously coloring the vertices and faces of a 1-planar graph may require at most six colors — for instance, in this triangular prism, no two of the 11 adjacent features of the same type (5 faces and 6 vertices) may take the same colors along an edge (shown here using an black color not counted), and no two of the 18 connection pairs of vertices and faces may take the same colors. Ringel conjectured in 1965 that six colors always suffice; this was proven in 1984 by Borodin. This coloring problem formed the inspiration for 1-planar graphs.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
http://creativecommons.org/publicdomain/zero/1.0/deed.enCC0Creative Commons Zero, Public Domain Dedicationfalsefalse
Captions
Add a one-line explanation of what this file represents