An Algorithm for the Chromatic Number of a Graph

DOI10.1145/321832.321837zbMath0284.05104OpenAlexW2077229887MaRDI QIDQ4770410

No author found.

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321837

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Efficient bounds on a branch and bound algorithm for graph colouration ⋮ A note on the complexity of the chromatic number problem ⋮ Exact algorithms for counting 3-colorings of graphs ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ Numerical experiences with graph coloring algorithms