GroetzschGraph returns the smallest triangle-free graph with chromatic number 4. This is identical to MycielskiGraph[4].

IndependentSetQ[g, i] yields True if the vertices in list i define an independent set in graph g.

InduceSubgraph[g, s] constructs the subgraph of graph g induced by the list of vertices s.

IntervalGraph[l] constructs the interval graph defined by the list of intervals l.

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

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

DagumDistribution[p, a, b] represents a Dagum distribution with shape parameters p and a and scale parameter b.

ChangeEdges[g, e] replaces the edges of graph g with the edges in e. e can have the form {{s_1, t_1}, {s_2, t_2}, ...} or the form {{{s_1, t_1}, gr_1}, {{s_2, t_2}, gr_2}, ...

ChangeVertices[g, v] replaces the vertices of graph g with the vertices in the given list v. v can have the form {{x_1, y_1}, {x_2, y_2}, ...} or the form {{{x_1, y_1}, ...

AxesOrigin is an option for graphics functions that specifies where any axes drawn should cross.