HamiltonianGraphQ

HamiltonianGraphQ(graph)

returns True if graph is an hamiltonian graph, and False otherwise.

See:

• Wikipedia - Hamiltonian path
• Wikipedia - Hamiltonian path problem

Examples

>> HamiltonianGraphQ(Graph({1 -> 2, 2 -> 3, 3 -> 4, 4 -> 1}))
True

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of HamiltonianGraphQ