HamiltonianQ (Combinatorica Package Symbol)

HamiltonianQ[g] yields True if there exists a Hamiltonian cycle in graph g, or in other words, if there exists a cycle that visits each vertex exactly once.

Harary (Combinatorica Package Symbol)

Harary[k, n] constructs the minimal k-connected graph on n vertices.

HasseDiagram (Combinatorica Package Symbol)

HasseDiagram[g] constructs a Hasse diagram of the relation defined by directed acyclic graph g.

HeawoodGraph (Combinatorica Package Symbol)

HeawoodGraph returns a smallest (6, 3)-cage, a 3-regular graph with girth 6.

HideCycles (Combinatorica Package Symbol)

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

HighlightedEdgeColors (Combinatorica Package Symbol)

HighlightedEdgeColors is an option to Highlight that determines which colors are used for the highlighted edges.

HighlightedEdgeStyle (Combinatorica Package Symbol)

HighlightedEdgeStyle is an option to Highlight that determines how the highlighted edges are drawn.

HighlightedVertexColors (Combinatorica Package Symbol)

HighlightedVertexColors is an option to Highlight that determines which colors are used for the highlighted vertices.

HighlightedVertexStyle (Combinatorica Package Symbol)

HighlightedVertexStyle is an option to Highlight that determines how the highlighted vertices are drawn.

Hypercube (Combinatorica Package Symbol)

Hypercube[n] constructs an n-dimensional hypercube.