IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.
LeviGraph returns the unique (8, 3)-cage, a 3-regular graph whose girth is 8.
McGeeGraph returns the unique (7, 3)-cage, a 3-regular graph with girth 7.
MycielskiGraph[k] returns a triangle-free graph with chromatic number k, for any positive integer k.
NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.
OctahedralGraph returns the graph corresponding to the octahedron, a Platonic solid.
RobertsonGraph returns a 19-vertex graph that is the unique (4, 5)-cage graph.
TetrahedralGraph returns the graph corresponding to the tetrahedron, a Platonic solid.
TutteGraph returns the Tutte graph, the first known example of a 3-connected, 3-regular, planar graph that is non-Hamiltonian.
Uniquely3ColorableGraph returns a 12-vertex, triangle-free graph with chromatic number 3 that is uniquely 3-colorable.