A note on the complexity of the chromatic number problem
Author:
- E.L. LawlerELE.L. Lawler
- 1 August 1976
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 5 (3) , 66-67
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- An Algorithm for the Chromatic Number of a GraphJournal of the ACM, 1974
- An Algorithm for Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1973
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971