ChromaticNumber[g] gives the chromatic number of the graph, which is the fewest number of colors necessary to color the graph.
CubicalGraph returns the graph corresponding to the cube, a Platonic solid.
DodecahedralGraph returns the graph corresponding to the dodecahedron, a Platonic solid.
GroetzschGraph returns the smallest triangle-free graph with chromatic number 4. This is identical to MycielskiGraph[4].
HighlightedEdgeColors is an option to Highlight that determines which colors are used for the highlighted edges.
HighlightedEdgeStyle is an option to Highlight that determines how the highlighted edges are drawn.
HighlightedVertexColors is an option to Highlight that determines which colors are used for the highlighted vertices.
HighlightedVertexStyle is an option to Highlight that determines how the highlighted vertices are drawn.
IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.
LabeledTreeToCode[g] reduces the tree g to its Prüfer code.