Powers of Hamiltonian paths in interval graphs

DOI10.1002/(SICI)1097-0118(199805)28:1%3C31::AID-JGT3%3E3.0.CO;2-GMaRDI QIDQ4242795zbMATH OpenOpenAlexFDO

Authors Garth Isaak

Publication date 11 May 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199805)28:1%3C31::aid-jgt3%3E3.0.co;2-g

zbMATH Keywords

greedy algorithmHamiltonian completion numberHamiltonian path powersinterval graphslinear arrangementtoughness

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian powers in threshold and arborescent comparability graphs
• Paths in interval graphs and circular arc graphs
• Finding Hamiltonian circuits in interval graphs
• Hamiltonian circuits in interval graph generalizations
• scientific article; zbMATH DE number 4045800

Cited in

(17)

• Antibandwidth and cyclic antibandwidth of meshes and hypercubes
• Antibandwidth of complete \(k\)-ary trees
• Finding Hamiltonian circuits in interval graphs
• Hamiltonian powers in threshold and arborescent comparability graphs
• The multi-stripe travelling salesman problem
• The maximum \(k\)-differential coloring problem
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Gene clusters as intersections of powers of paths
• Antibandwidth of Complete k-Ary Trees
• Antibandwidth of Three-Dimensional Meshes
• scientific article; zbMATH DE number 4045800 (Why is no real title available?)
• A special antidilation problem for meshes and Hamming graphs
• A note on maximum differential coloring of planar graphs
• Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
• Memetic algorithm for the antibandwidth maximization problem
• Antibandwidth of three-dimensional meshes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242795)