A note on the complexity of the chromatic number problem
type: Item
instance of: scholarly article
title: A note on the complexity of the chromatic number problem
zbMATH Open document ID: 0336.68021
DOI: 10.1016/0020-0190(76)90065-X
published in: Information Processing Letters
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3526291
Wikidata QID: Q56269094
author: Eugene L. Lawler
MaRDI profile type: Publication
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: An Algorithm for Determining the Chromatic Number of a Graph
cites work: An algorithm for the chromatic number of a graph
cites work: Q4083457
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: Q5670645
cites work: Corrections to Bierstone's Algorithm for Generating Cliques
cites work: An Algorithm for the Chromatic Number of a Graph
DBLP publication ID: journals/ipl/Lawler76
description: scientific article; zbMATH DE number 3526291