Computing clique and chromatic number of circular-perfect graphs in polynomial time

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00760621
Contributor : Arnaud Pêcher <>
Submitted on : Tuesday, December 4, 2012 - 10:45:17 AM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM

Identifiers

  • HAL Id : hal-00760621, version 1

Citation

Arnaud Pêcher, Annegret K. Wagler. Computing clique and chromatic number of circular-perfect graphs in polynomial time. Mathematical Programming A, 2013, 141, pp.121-133. ⟨hal-00760621⟩

Share

Metrics

Record views

383