On the polynomial time computability of the circular chromatic number for some superclasses of perfect graph

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00790656
Contributor : Arnaud Pêcher <>
Submitted on : Wednesday, February 20, 2013 - 4:56:52 PM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM

Identifiers

  • HAL Id : hal-00790656, version 1

Citation

Arnaud Pêcher, Annegret K. Wagler. On the polynomial time computability of the circular chromatic number for some superclasses of perfect graph. Lagos'09, 2009, Brazil. pp.53-58. ⟨hal-00790656⟩

Share

Metrics

Record views

441