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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
Normal rank
 
Property / author
 
Property / author: Q790131 / rank
Normal rank
 
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
 
Normal rank
Property / author
 
Property / author: Pavol Hell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00189-p / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052903450 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:18, 30 July 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
    0 references