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

DOI10.1016/0020-0190(73)90009-4MaRDI QIDQ2264680zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• An algorithm for the chromatic number of a graph
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• On cliques in graphs
• Parallel concepts in graph theory
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Cited in

(1)

• Efficient bounds on a branch and bound algorithm for graph colouration

Describes a project that uses

Uses Software

• Algorithm 457

This page was built for publication: An algorithm for obtaining the chromatic number and an optimal coloring of a graph

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