A note on the complexity of the chromatic number problem (Q1229753): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Eugene L. Lawler / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q56269094 / rank
 
Normal rank
Property / author
 
Property / author: Eugene L. Lawler / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Scheduling and the Chromatic Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining the Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Bierstone's Algorithm for Generating Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Chromatic Number of a Graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:36, 12 June 2024

scientific article
Language Label Description Also known as
English
A note on the complexity of the chromatic number problem
scientific article

    Statements

    Identifiers