On the theta number of powers of cycle graphs
BACHOC, Christine
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
BACHOC, Christine
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Langue
en
Article de revue
Ce document a été publié dans
Combinatorica. 2013-12-01, vol. 33, n° 3, p. 297-317
Springer Verlag
Résumé en anglais
We give a closed formula for Lovász's theta number of the powers of cycle graphs $C_k^d$ and of their complements, the circular complete graphs $K_{k/d}$. As a consequence, we establish that the circular chromatic number ...Lire la suite >
We give a closed formula for Lovász's theta number of the powers of cycle graphs $C_k^d$ and of their complements, the circular complete graphs $K_{k/d}$. As a consequence, we establish that the circular chromatic number of a circular perfect graph is computable in polynomial time. We also derive an asymptotic estimate for the theta number of $C_k^d$.< Réduire
Project ANR
/ - ANR-09-BLAN-0373
Origine
Importé de halUnités de recherche