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

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00920846
Contributor : Arnaud Pêcher <>
Submitted on : Thursday, December 19, 2013 - 12:12:25 PM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM

Identifiers

  • HAL Id : hal-00920846, version 1

Citation

Arnaud Pêcher, Annegret K. Wagler. Computing the clique number of a-perfect graphs in polynomial time. European Journal of Combinatorics, Elsevier, 2014, 35, pp.449-458. ⟨hal-00920846⟩

Share

Metrics

Record views

362