Colourings, homomorphisms, and partitions of transitive digraphs (Q338575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring by locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex cover obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor‐order obstructions for the graphs of vertex cover 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into complete and empty graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix partitions of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On realizations of point determining graphs, and obstructions to full homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colourings, homomorphisms, and partitions of transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph matrix partitions and trigraph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-kernels in generalizations of transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitions with prescribed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Girth via Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank

Latest revision as of 21:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Colourings, homomorphisms, and partitions of transitive digraphs
scientific article

    Statements

    Colourings, homomorphisms, and partitions of transitive digraphs (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic colourings
    0 references
    \((k, \ell)\)-colourings
    0 references
    0 references
    0 references