Powers of Hamiltonian paths in interval graphs

DOI<31::AID-JGT3>3.0.CO;2-G 10.1002/(SICI)1097-0118(199805)28:1<31::AID-JGT3>3.0.CO;2-GzbMath0919.05040OpenAlexW4231756714MaRDI QIDQ4242795

Garth Isaak

Publication date: 11 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199805)28:1<31::aid-jgt3>3.0.co;2-g

zbMATH Keywords

greedy algorithminterval graphstoughnesslinear arrangementHamiltonian completion numberHamiltonian path powers

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

The maximum \(k\)-differential coloring problem ⋮ 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 ⋮ A note on maximum differential coloring of planar graphs ⋮ Antibandwidth of three-dimensional meshes ⋮ Antibandwidth and cyclic antibandwidth of meshes and hypercubes ⋮ Antibandwidth of complete \(k\)-ary trees ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs ⋮ Hamiltonian powers in threshold and arborescent comparability graphs ⋮ Antibandwidth of Complete k-Ary Trees ⋮ Antibandwidth of Three-Dimensional Meshes ⋮ Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs

This page was built for publication: Powers of Hamiltonian paths in interval graphs