Hamiltonian powers in threshold and arborescent comparability graphs

@article{Donnelly1999HamiltonianPI,
  title={Hamiltonian powers in threshold and arborescent comparability graphs},
  author={Sam Donnelly and Garth Isaak},
  journal={Discrete Mathematics},
  year={1999},
  volume={202},
  pages={33-44}
}
Abstract We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ·obvious’ minimax condition fails. For cographs we give examples showing that toughness and other ·obvious… CONTINUE READING
BETA

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Toughness

D. Kratsch, J. Lehel, H. Muller
  • Hamiltonicity and Split Graphs, Disc. Math. 150
  • 1996
VIEW 1 EXCERPT

J

D. Bauer
  • van den Heuval and E. Schmeichel, Toughness and triangle free graphs, J. Comb. Theory B 65
  • 1995
VIEW 1 EXCERPT