NP-completeness of local colorings of graphs (Q1679905): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with locally few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Kneser's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local colourings of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on local coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local coloring of Kneser graphs / rank
 
Normal rank

Latest revision as of 19:07, 14 July 2024

scientific article
Language Label Description Also known as
English
NP-completeness of local colorings of graphs
scientific article

    Statements

    NP-completeness of local colorings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2017
    0 references
    0 references
    local \(k\)-coloring
    0 references
    local chromatic number
    0 references
    planar graph
    0 references
    NP-complete
    0 references
    computational complexity
    0 references
    0 references