NonLineGraphs returns a graph whose connected components are the 9 graphs whose presence as a vertex-induced subgraph in a graph g makes g a nonline graph.

NormalizeVertices[v] gives a list of vertices with a similar embedding as v but with the coordinates of all points scaled to be between 0 and 1.

ReadGraph[f] reads a graph represented as edge lists from file f and returns a graph object.

RegularQ[g] yields True if g is a regular graph.

RemoveMultipleEdges[g] returns the graph obtained by deleting multiple edges from g.

RemoveSelfLoops[g] returns the graph obtained by deleting self-loops in g.

ResidualFlowGraph[g, flow] returns the directed residual flow graph for graph g with respect to flow.

ReverseEdges[g] flips the directions of all edges in a directed graph.

SmallestCyclicGroupGraph returns a smallest nontrivial graph whose automorphism group is cyclic.

TreeIsomorphismQ[t_1, t_2] yields True if the trees t_1 and t_2 are isomorphic. It yields False otherwise.