Digraph matrix partitions and trigraph homomorphisms
Authors:
- Tomás FederTFTomás Feder
- Pavol HellPHPavol Hell
- Kim Tucker-NallyKTKim Tucker-Nally
- 1 November 2006
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (17) , 2458-2469
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Full Constraint Satisfaction ProblemsSIAM Journal on Computing, 2006
- List matrix partitions of chordal graphsTheoretical Computer Science, 2005
- The recognition of bound quivers using edge-coloured homomorphismsDiscrete Mathematics, 2005
- Stable skew partition problemDiscrete Applied Mathematics, 2004
- List PartitionsSIAM Journal on Discrete Mathematics, 2003
- Bi‐arc graphs and the complexity of list homomorphismsJournal of Graph Theory, 2002
- Finding Skew Partitions EfficientlyJournal of Algorithms, 2000
- Complexity of graph partition problems1999
- Homomorphisms of Edge-Colored Graphs and Coxeter GroupsJournal of Algebraic Combinatorics, 1998
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988