Publication:4242795
From MaRDI portal
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.05040MaRDI QIDQ4242795
Publication date: 11 May 1999
greedy algorithm; interval graphs; toughness; linear arrangement; Hamiltonian completion number; Hamiltonian path powers
05C45: Eulerian and Hamiltonian graphs
Related Items
Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs, A special antidilation problem for meshes and Hamming graphs, A note on maximum differential coloring of planar graphs, Memetic algorithm for the antibandwidth maximization problem, Antibandwidth of three-dimensional meshes, Antibandwidth and cyclic antibandwidth of meshes and hypercubes, Antibandwidth of complete \(k\)-ary trees, Hamiltonian powers in threshold and arborescent comparability graphs, The maximum \(k\)-differential coloring problem, Antibandwidth and cyclic antibandwidth of Hamming graphs, Antibandwidth and Cyclic Antibandwidth of Hamming Graphs, Antibandwidth of Complete k-Ary Trees, Antibandwidth of Three-Dimensional Meshes