Efficient bounds on a branch and bound algorithm for graph colouration

DOI10.1080/0020739910220516zbMath0759.05036OpenAlexW2065321253MaRDI QIDQ4009325

Sydney C. K. Chu

Publication date: 27 September 1992

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739910220516

zbMATH Keywords

chromatic polynomialbound algorithmgraph colouration

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
• A note on the complexity of the chromatic number problem
• An algorithm for obtaining the chromatic number and an optimal coloring of a graph
• Some Examples of Combinatorial Averaging
• A theoretical analysis of backtracking in the graph coloring problem
• An Algorithm for Determining the Chromatic Number of a Graph
• An Algorithm for the Chromatic Number of a Graph
• An algorithm for the chromatic number of a graph
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Efficient bounds on a branch and bound algorithm for graph colouration