Approximation Algorithms for the Achromatic Number

DOI10.1006/jagm.2001.1192zbMath1051.05076OpenAlexW3136469491WikidataQ55966566 ScholiaQ55966566MaRDI QIDQ2775897

Amitabh Chaudhary, Sundar Vishwanathan

Publication date: 8 July 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2001.1192

zbMATH Keywords

approximation algorithmNP-completenessgraph algorithmsachromatic numbercomplete coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Minimum order of graphs with given coloring parameters ⋮ On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem ⋮ Achromatic number of fragmentable graphs

This page was built for publication: Approximation Algorithms for the Achromatic Number