Colourings, Homomorphisms, and Partitions of Transitive Digraphs

Tomás Feder; Pavol Hell; César Hernández-Cruz

Colourings, Homomorphisms, and Partitions of Transitive Digraphs

Combinatorics 2015-10-28 v1

Authors: Tomás Feder , Pavol Hell , César Hernández-Cruz

Abstract

We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$ -colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured, many problems are intractable, and their complexity turns out to be difficult to classify. We present some motivational results and several open problems.

Keywords

transitive digraphs graph colourings homomorphisms matrix partitions computational complexity acyclic colourings (k, l)-colourings

Cite

@article{arxiv.1510.07744,
  title  = {Colourings, Homomorphisms, and Partitions of Transitive Digraphs},
  author = {Tomás Feder and Pavol Hell and César Hernández-Cruz},
  journal= {arXiv preprint arXiv:1510.07744},
  year   = {2015}
}

Comments

13 pages, 3 figures

Colourings, Homomorphisms, and Partitions of Transitive Digraphs

Abstract

Keywords

Cite

Comments

Related papers