On the theta number of powers of cycle graphs

DOI10.1007/s00493-013-2950-xzbMath1349.05100arXiv1103.0444OpenAlexW2022896066MaRDI QIDQ2439827

Arnaud Pêcher, Christine Bachoc, 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

zbMATH Keywords

circular chromatic numbercycle graphsLovász's theta number

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

On the independence number of some strong products of cycle-powers ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ New lower bound on the Shannon capacity of \(C_7\) from circular graphs ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ On circular-perfect graphs: a survey ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Semidefinite programming bounds for Lee codes

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

This page was built for publication: On the theta number of powers of cycle graphs