An exact graph coloring algorithm using color exchange

zbMATH Open0887.05022MaRDI QIDQ1374088FDOQ1374088

Authors: J. Ning 

Publication date: 2 December 1997

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4006291
• scientific article; zbMATH DE number 956855
• A Pruning Procedure for Exact Graph Coloring
• An exact method for graph coloring

zbMATH Keywords

algorithmchromatic numbercoloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• An exact method for graph coloring
• Title not available (Why is that?)
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles

This page was built for publication: An exact graph coloring algorithm using color exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374088)