The Complexity of Colouring by Semicomplete Digraphs
From MaRDI portal
Recommendations
Cited in
(51)- List homomorphisms to reflexive graphs
- Polynomial graph-colorings
- Homomorphisms to oriented cycles
- The complexity of colouring symmetric relational systems
- Graph homomorphisms with infinite targets
- Homomorphisms to oriented paths
- The complexity of restricted graph homomorphisms
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Oriented incidence colourings of digraphs
- Hereditarily hard \(H\)-colouring problems
- Core-like properties of infinite graphs and structures
- Homomorphically full graphs
- Complexity of tree homomorphisms
- The complexity of tropical graph homomorphisms
- List homomorphism problems for signed trees
- Chromatic polynomials of oriented graphs
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- On digraph coloring problems and treewidth duality
- Minimum cost and list homomorphisms to semicomplete digraphs
- Graph partitions with prescribed patterns
- Dichotomy for finite tournaments of mixed-type
- The recognition of bound quivers using edge-coloured homomorphisms
- Locally Semicomplete Digraphs and Generalizations
- Surjective \texttt{H}-colouring over reflexive digraphs
- scientific article; zbMATH DE number 4008418 (Why is no real title available?)
- On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
- scientific article; zbMATH DE number 30749 (Why is no real title available?)
- The complexity of surjective homomorphism problems-a survey
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 866665 (Why is no real title available?)
- Path homomorphisms
- Small \(H\)-coloring problems for bounded degree digraphs
- Quantified Constraints in Twenty Seventeen
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- Polynomial graph-colorings
- On the complexity of digraph colourings and vertex arboricity
- Quantified constraint satisfaction problem on semicomplete digraphs
- Complexity and polymorphisms for digraph constraint problems under some basic constructions
- A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles
- SOFSEM 2006: Theory and Practice of Computer Science
- The complexity of arc-colorings for directed hypergraphs
- On the complexity of colouring by superdigraphs of bipartite graphs
- The core of a graph
- On the absolute and relative oriented clique problems' time complexity
- The complexity of colouring by locally semicomplete digraphs
- \(H\)-coloring degree-bounded (acyclic) digraphs
- Digraph matrix partitions and trigraph homomorphisms
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
- The effect of two cycles on the complexity of colourings by directed graphs
- Minimum cost homomorphisms to semicomplete multipartite digraphs
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
This page was built for publication: The Complexity of Colouring by Semicomplete Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834066)
