An Algorithm for Determining the Chromatic Number of a Graph

DOI10.1137/0202026zbMath0282.05104OpenAlexW2024527820MaRDI 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

Mathematics Subject Classification ID

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

Related Items (6)

Efficient bounds on a branch and bound algorithm for graph colouration ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ A note on the complexity of the chromatic number problem ⋮ Unnamed Item ⋮ A simple branching scheme for vertex coloring problems ⋮ On the chromatic forcing number of a random graph

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