On approximating the achromatic number

DOI10.1137/S0895480100379579MaRDI QIDQ2753533zbMATH OpenOpenAlexFDO

Authors 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

achromatic numberapproximation algorithmsgraph coloring

Mathematics Subject Classification ID

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

Recommendations

• On approximating the achromatic number (preliminary version)
• Approximation algorithms for the achromatic number.
• scientific article; zbMATH DE number 1405798
• scientific article; zbMATH DE number 3882457
• Efficient approximation algorithms for the achromatic number

Cited in

(13)

• On upper bounds for the pseudo-achromatic index
• The achromatic number of the union of cycles
• Efficient approximation algorithms for the achromatic number
• On approximating the achromatic number (preliminary version)
• Approximation algorithms for the achromatic number.
• Achromatic number of fragmentable graphs
• scientific article; zbMATH DE number 3882457 (Why is no real title available?)
• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• Minimum order of graphs with given coloring parameters
• scientific article; zbMATH DE number 1405798 (Why is no real title available?)
• Approximating the achromatic number problem on bipartite graphs
• Parameterized Reunion with achromatic number
• Complete partitions of graphs

This page was built for publication: On approximating the achromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753533)