This image was acquired from
wikimedia. It was marked as Public Domain or CC0 and is free to use. To verify, go to the source and check the information there.
Keywords from Image Description:
Prismvfcolor.svg coloring the vertices and faces of planar graph may require six colors for instance in this triangular prism no three of the features may take the same color Ringel conjectured in that six colors always suffice this was proven in by Borodin This coloring problem formed the inspiration for planar graphs own