An Algorithm for Determining the Chromatic Number of a Graph
From MaRDI portal
Publication:4766993
DOI10.1137/0202026zbMath0282.05104MaRDI QIDQ4766993
No author found.
Publication date: 1973
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0202026
05C15: Coloring of graphs and hypergraphs
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
A simple branching scheme for vertex coloring problems, Chromatic optimisation: Limitations, objectives, uses, references, A note on the complexity of the chromatic number problem, On the chromatic forcing number of a random graph, Efficient bounds on a branch and bound algorithm for graph colouration