Computing the clique number of a-perfect graphs in polynomial time

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00592080
Contributor : Arnaud Pêcher <>
Submitted on : Wednesday, May 11, 2011 - 9:40:00 AM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM

Identifiers

  • HAL Id : hal-00592080, version 1

Citation

Arnaud Pêcher, Annegret K. Wagler. Computing the clique number of a-perfect graphs in polynomial time. Proceedings of Eurocomb'11, Aug 2011, Budapest, Hungary. pp.705-710. ⟨hal-00592080⟩

Share

Metrics

Record views

366