McGeeGraph returns the unique (7, 3)-cage, a 3-regular graph with girth 7.

MinimumChainPartition[g] partitions partial-order g into a minimum number of chains.

MycielskiGraph[k] returns a triangle-free graph with chromatic number k, for any positive integer k.

NextComposition[l] constructs the integer composition that follows l in a canonical order.

NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.

NormalDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.

NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.

OctahedralGraph returns the graph corresponding to the octahedron, a Platonic solid.

One is a tag used in several functions to inform the functions that only one object need be considered or only one solution be produced, as opposed to all objects or all ...

Optimum is a value that the option Algorithm can take on when used in functions VertexColoring and VertexCover.