On Various Algorithms for Estimating the Chromatic Number of a Graph

DOI10.1093/comjnl/19.2.182zbMath0334.05104OpenAlexW2114148358MaRDI QIDQ4099662

John Mitchem

Publication date: 1976

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/19.2.182

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Graph, clique and facet of Boolean logical polytope ⋮ Unnamed Item ⋮ Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement ⋮ The smallest hard-to-color graph ⋮ Numerical experiences with graph coloring algorithms

This page was built for publication: On Various Algorithms for Estimating the Chromatic Number of a Graph