Hereditarily hard \(H\)-colouring problems (Q1842146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The effect of two cycles on the complexity of colourings by directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Colouring by Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of colouring by superdigraphs of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial graph-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplicative graphs and the product conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms to oriented paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph homomorphisms with infinite targets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the general coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and interpretations: a connection between graphs and grammar forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of relations and graphs determined by subobjects and factorobjects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-families are dense / rank
 
Normal rank

Revision as of 12:06, 23 May 2024

scientific article
Language Label Description Also known as
English
Hereditarily hard \(H\)-colouring problems
scientific article

    Statements

    Hereditarily hard \(H\)-colouring problems (English)
    0 references
    0 references
    0 references
    0 references
    19 July 1995
    0 references
    H-colouring
    0 references
    digraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references