An algorithm to determine the chromatic number of a graph

MaRDI QIDQ3402500zbMATH OpenFDO

Authors C. V. Shantharaju, Veena Mathad

Publication date 4 February 2010

zbMATH Keywords

chromatic numbercolor class

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• New Algorithm for Chromatic Number of Graphs and their Applications
• Algorithmic bounds for the chromatic number†
• scientific article; zbMATH DE number 847107
• An approximation chromatic number of a graph
• Finding the chromatic number by means of critical graphs

Cited in

(4)

• scientific article; zbMATH DE number 1998817 (Why is no real title available?)
• Finding the chromatic number by means of critical graphs
• A new algorithmic method to compute the chromatic number of dihedral group
• scientific article; zbMATH DE number 847107 (Why is no real title available?)

This page was built for publication: An algorithm to determine 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 Q3402500)