Hamiltonian powers in threshold and arborescent comparability graphs

DOI10.1016/S0012-365X(98)00346-XzbMath0932.05052MaRDI QIDQ1301703

Garth Isaak, Sam Donnelly

Publication date: 21 March 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleHamiltonian pathsEulerianthreshold graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Memetic algorithm for the antibandwidth maximization problem ⋮ The multi-stripe travelling salesman problem ⋮ A special antidilation problem for meshes and Hamming graphs ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ Antibandwidth of three-dimensional meshes ⋮ Antibandwidth and cyclic antibandwidth of meshes and hypercubes ⋮ GRASP with path relinking heuristics for the antibandwidth problem ⋮ Antibandwidth of complete \(k\)-ary trees ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs ⋮ Antibandwidth of Complete k-Ary Trees ⋮ Antibandwidth of Three-Dimensional Meshes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complement reducible graphs
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
• Longest cycles in threshold graphs
• 1-tough cocomparability graphs are hamiltonian
• Threshold graphs and related topics
• Scheduling dyadic intervals
• Toughness and triangle-free graphs
• Toughness, hamiltonicity and split graphs
• Tough graphs and Hamiltonian circuits.
• Powers of Hamiltonian paths in interval graphs
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

This page was built for publication: Hamiltonian powers in threshold and arborescent comparability graphs