Algorithms - ESA 2003
From MaRDI portal
Publication:5897262
DOI10.1007/b13632zbMath1266.68230OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897262
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
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Minimum order of graphs with given coloring parameters ⋮ Complete partitions of graphs ⋮ Efficient approximation algorithms for the achromatic number
This page was built for publication: Algorithms - ESA 2003
