A tree representation for P4-sparse graphs
Discrete Applied Mathematics
P-Components and the Homogeneous Decomposition of Graphs
SIAM Journal on Discrete Mathematics
On the structure of graphs with few P4s
Discrete Applied Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Finding skew partitions efficiently
Journal of Algorithms
SIAM Journal on Discrete Mathematics
Fast Skew Partition Recognition
Computational Geometry and Graph Theory
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The computational complexity of disconnected cut and 2K2-partition
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
| Hi-index | 0.05 |
We consider the problem of partitioning the vertex-set of a graph into four non-empty sets A,B,C,D such that every vertex of A is adjacent to every vertex of B and every vertex of C is adjacent to every vertex of D. The complexity of deciding if a graph admits such a partition is unknown. We show that it can be solved in polynomial time for several classes of graphs: K"4-free graphs, diamond-free graphs, planar graphs, graphs with bounded treewidth, claw-free graphs, (C"5,P"5)-free graphs and graphs with few P"4's.