Hamiltonian graph

Hamiltonian graph

[‚ham·əl′tō·nē·ən ‚graf]
(mathematics)
A graph which has a Hamiltonian path.
References in periodicals archive ?
For a graph G to be k-cyclic Hamiltonian, We call such an integer k as a cyclic hamiltonian generator of G, or G as cyclic hamiltonian graph generated by k.
Early chapters present fundamentals of graph theory that lie outside of graph colorings, including basic terms and results, trees and connectivity, Eulerian and Hamiltonian graphs, matching and factorizations, and graph embeddings.
Hamiltonian graphs are also explained, including those that are optimal k-fault tolerant and optimal 1- fault tolerant.