On the complexity of graph coloring with additional local conditions (Q1708276): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5461691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Kneser's conjecture / 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: NP-completeness of local colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local coloring of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 09:35, 15 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of graph coloring with additional local conditions
scientific article

    Statements

    On the complexity of graph coloring with additional local conditions (English)
    0 references
    0 references
    5 April 2018
    0 references
    computational complexity
    0 references
    graph coloring
    0 references
    fixed-parameter tractability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references