On Approximating the Achromatic Number

DOI10.1137/S0895480100379579zbMath0977.68063OpenAlexW2095076737MaRDI QIDQ2753533

Robert Krauthgamer, Guy Kortsarz

Publication date: 11 November 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100379579

zbMATH Keywords

graph coloringachromatic numberapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (4)

Minimum order of graphs with given coloring parameters ⋮ Complete partitions of graphs ⋮ Achromatic number of fragmentable graphs ⋮ Efficient approximation algorithms for the achromatic number

This page was built for publication: On Approximating the Achromatic Number