Abu-Khzam, Faisal N.; Feghali, Carl; Muller, Haiko
(2015-12-07)
A graph G=(V,E) is partitionable if there exists a partition {A,B} of V such that A induces a disjoint union of cliques (i.e. , G[A] is P3-free) and B induces a triangle-free graph (i.e. , G[B] is K3-free). In this ...