Sunday is a day of the week.

Thursday is a day of the week.

Tuesday is a day of the week.

Wednesday is a day of the week.

AlternatingPaths[g, start, ME] returns the alternating paths in graph g with respect to the matching ME, starting at the vertices in the list start. The paths are returned in ...

ArticulationVertices[g] gives a list of all articulation vertices in graph g. These are vertices whose removal will disconnect the graph.

BiconnectedComponents[g] gives a list of the biconnected components of graph g. If g is directed, the underlying undirected graph is used.

BrelazColoring[g] returns a vertex coloring in which vertices are greedily colored with the smallest available color in decreasing order of vertex degree.

Bridges[g] gives a list of the bridges of graph g, where each bridge is an edge whose removal disconnects the graph.

CodeToLabeledTree[l] constructs the unique labeled tree on n vertices from the Prüfer code l, which consists of a list of n - 2 integers between 1 and n.