An Algorithm for the Chromatic Number of a Graph

DOI10.1145/321832.321837MaRDI QIDQ4770410zbMATH OpenOpenAlexFDO

Authors

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

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

Cited in

(6)

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

This page was built for publication: An Algorithm for the Chromatic Number of a Graph

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