On Various Algorithms for Estimating the Chromatic Number of a Graph

DOI10.1093/COMJNL/19.2.182MaRDI QIDQ4099662zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(5)

• Numerical experiences with graph coloring algorithms
• The smallest hard-to-color graph
• Graph, clique and facet of Boolean logical polytope
• scientific article; zbMATH DE number 3683613 (Why is no real title available?)
• Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement

This page was built for publication: On Various Algorithms for Estimating 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 Q4099662)