About recognizing (&agr; &bgr;) classes of polar graphs
Discrete Mathematics
The complexity of colouring by semicomplete digraphs
SIAM Journal on Discrete Mathematics
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Induced subgraphs and well-quasi-ordering
Journal of Graph Theory
The effect of two cycles on the complexity of colouring by directed graphs
Discrete Applied Mathematics
On the complexity of colouring by superdiagraphs of bipartite graphs
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Homomorphisms to oriented paths
Discrete Mathematics
Hereditarily hard H-colouring problems
Selected papers of the 14th British conference on Combinatorial conference
Partitions of graphs into one or two independent sets and cliques
Discrete Mathematics
Complexity of tree homomorphisms
Discrete Applied Mathematics
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
The complexity of H-colouring of bounded degree graphs
Discrete Mathematics
Duality theorems for finite structures (characterising gaps and good characterisations)
Journal of Combinatorial Theory Series B
Finding skew partitions efficiently
Journal of Algorithms
Computational Complexity of Compaction to Reflexive Cycles
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Two algorithms for general list matrix partitions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
SIAM Journal on Discrete Mathematics
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
Full Constraint Satisfaction Problems
SIAM Journal on Computing
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Homomorphism preservation theorems
Journal of the ACM (JACM)
Bi-arc graphs and the complexity of list homomorphisms
Journal of Graph Theory
Journal of Graph Theory
Near-Unanimity Functions and Varieties of Reflexive Graphs
SIAM Journal on Discrete Mathematics
Discrete Applied Mathematics
Fast Skew Partition Recognition
Computational Geometry and Graph Theory
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Extension problems with degree bounds
Discrete Applied Mathematics
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science
Dualities in full homomorphisms
European Journal of Combinatorics
A New Proof of the $H$-Coloring Dichotomy
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Dichotomy for tree-structured trigraph list homomorphism problems
Discrete Applied Mathematics
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Algorithms for partition of some class of graphs under compaction
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The computational complexity of disconnected cut and 2K2-partition
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
Matrix partitions of split graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We discuss partition problems that generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. Depending on the pattern, we seek a finite forbidden induced subgraph characterization, or at least a polynomial time algorithm. We give an overview of the current knowledge, focusing on open problems and recent breakthroughs.