On the theta number of powers of cycle graphs
From MaRDI portal
Publication:2439827
DOI10.1007/s00493-013-2950-xzbMath1349.05100arXiv1103.0444MaRDI QIDQ2439827
Christine Bachoc, Arnaud Pêcher, Alain Thiery
Publication date: 17 March 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0444
90C27: Combinatorial optimization
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- Polynomial time computability of some graph parameters for superclasses of perfect graphs
- Clique and chromatic number of circular-perfect graphs
- A note on the star chromatic number
- Star chromatic number
- On the Shannon capacity of a graph
- Circular perfect graphs
- A limit theorem for the Shannon capacities of odd cycles. II
- Semidefinite Programming