Achromatic Number is NP-Complete for Cographs and Interval Graphs

@article{Bodlaender1989AchromaticNI,
  title={Achromatic Number is NP-Complete for Cographs and Interval Graphs},
  author={Hans L. Bodlaender},
  journal={Inf. Process. Lett.},
  year={1989},
  volume={31},
  pages={135-138}
}
classes of cographs and of interval graphs bo ve the property that very few NP-complete problems on unlabelled graphs stay NP-complete when restricted to the respective class. Polynomial-time algorithms for NP-complete problems restricted to cographs can be found e.g. ;n [4,3]. A large class of problems, solvable in polynomial time on cographs can be found with a method, developed for small treewidth-graphs by Amborg, Lagergren and Seese [l]. As the class of cographs is contained in the class… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Complement reducible graphs , Iplsc

  • A. A. Bertossi
  • Applied Math .

Similar Papers

Loading similar papers…