Complexity issues on bounded restrictive \(H\)-coloring (Q2370448): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The restrictive \(H\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank

Latest revision as of 10:35, 26 June 2024

scientific article
Language Label Description Also known as
English
Complexity issues on bounded restrictive \(H\)-coloring
scientific article

    Statements

    Complexity issues on bounded restrictive \(H\)-coloring (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    restrictive \(H\)-coloring
    0 references
    restrictive list \(H\)-coloring
    0 references
    parameterization
    0 references
    counting problems
    0 references
    NP-complete
    0 references
    {\#}P-complete
    0 references
    0 references