An algorithm for obtaining the chromatic number and an optimal coloring of a graph

DOI10.1016/0020-0190(73)90009-4zbMath0274.05104OpenAlexW2042896495MaRDI QIDQ2264680

S. I. Roschke, Antonio L. Furtado

Publication date: 1973

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(73)90009-4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Efficient bounds on a branch and bound algorithm for graph colouration

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• An algorithm for the chromatic number of a graph
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Depth-First Search and Linear Graph Algorithms
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs