The Maximum k-Colorable Subgraph Problem and Related Problems
From MaRDI portal
Publication:5084675
DOI10.1287/ijoc.2021.1086MaRDI QIDQ5084675
Renata Sotirov, Juan Carlos Vera, Olga Kuryatnikova
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.09644
semidefinite programming; stable set; Johnson graphs; Hamming graphs; chromatic number of a graph; \(k\)-colorable subgraph problem; generalized theta number
90-XX: Operations research, mathematical programming