Coloring -colorable graphs using relatively small palettes
From MaRDI portal
Publication:4806594
DOI10.1016/S0196-6774(02)00217-1zbMath1030.68067OpenAlexW2074891431MaRDI QIDQ4806594
Eran Halperin, Uri Zwick, Ram Nathaniel
Publication date: 14 May 2003
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00217-1
Related Items
Copositive programming motivated bounds on the stability and the chromatic numbers, Unnamed Item, Improved Approximation Guarantees through Higher Levels of SDP Hierarchies, Computing the partition function for graph homomorphisms, Linear Index Coding via Semidefinite Programming, Unnamed Item, Convex Relaxations and Integrality Gaps, Wireless capacity with arbitrary gain matrix, Unnamed Item, Hardness of Rainbow Coloring Hypergraphs