The circular chromatic number of circular-perfect graphs is polytime

Arnaud Pêcher 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00652773
Contributor : Arnaud Pêcher <>
Submitted on : Friday, December 16, 2011 - 11:21:06 AM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Identifiers

  • HAL Id : hal-00652773, version 1

Citation

Arnaud Pêcher. The circular chromatic number of circular-perfect graphs is polytime. 2011 Workshop on Graph Theory, Mar 2011, Taipei, Taiwan. ⟨hal-00652773⟩

Share

Metrics

Record views

422