Approximating the achromatic number problem on bipartite graphs

DOI10.1007/B13632zbMATH Open1266.68230OpenAlexW1827234103MaRDI QIDQ5897262FDOQ5897262

Authors Guy Kortsarz, Sunil Shende 

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

Recommendations

• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• On approximating the achromatic number
• scientific article; zbMATH DE number 1947053
• On approximating the achromatic number (preliminary version)
• scientific article; zbMATH DE number 1405798

Cited in

(8)

• scientific article; zbMATH DE number 6096704 (Why is no real title available?)
• scientific article; zbMATH DE number 1947053 (Why is no real title available?)
• Achromatic number is NP-complete for cographs and interval graphs
• scientific article; zbMATH DE number 1405798 (Why is no real title available?)
• Complete partitions of graphs
• Efficient approximation algorithms for the achromatic number
• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• Minimum order of graphs with given coloring parameters

This page was built for publication: Approximating the achromatic number problem on bipartite graphs

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