EdgeStyle is an option that allows the user to associate different sizes and shapes to edges. A line segment is the default edge. EdgeStyle can be set as part of the graph ...

EulerianQ[g] yields True if graph g is Eulerian, meaning there exists a tour that includes each edge exactly once.

HamiltonianCycle[g] finds a Hamiltonian cycle in graph g if one exists. HamiltonianCycle[g, All] gives all Hamiltonian cycles of graph g.

HideCycles[c] canonically encodes the cycle structure c into a unique permutation.

InsertIntoTableau[e, t] inserts integer e into Young tableau t using the bumping algorithm. InsertIntoTableau[e, t, All] inserts e into Young tableau t and returns the new ...

KSubsetGroupIndex[g, s, x] returns the cycle index of the k-subset group on s expressed as a polynomial in x[1], x[2], .... This function also takes the optional argument ...

MinimumSpanningTree[g] uses Kruskal's algorithm to find a minimum spanning tree of graph g.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

Neighborhood[g, v, k] returns the subset of vertices in g that are at a distance of k or less from vertex v. Neighborhood[al, v, k] behaves identically, except that it takes ...

NumberOfKPaths[g, v, k] returns a sorted list that contains the number of paths of length k to different vertices of g from v.NumberOfKPaths[al, v, k] behaves identically, ...