Minimal obstructions for a matrix partition problem in chordal graphs
share
If M is an m × m matrix over { 0, 1, ∗}, an M-partition of a graph G is a partition (V_1, ... V_m) such that V_i is completely adjacent (non-adjacent) to V_j if M_ij = 1 (M_ij = 0), and there are no further restrictions between V_i and V_j if M_ij = ∗. Having an M-partition is a hereditary property, thus it can be characterized by a set of minimal obstructions (forbidden induced subgraphs minimal with the property of not having an M-partition). It is known that for every 3 × 3 matrix M over { 0, 1, ∗}, there are finitely many chordal minimal obstructions for the problem of determining whether a graph admits an M-partition, except for two matrices, M_1 = ( < a r r a y > ) and M_2 = ( < a r r a y > ). For these two matrices an infinite family of chordal minimal obstructions is known (the same family for both matrices), but the complete set of minimal obstructions is not. In this work we present the complete family of chordal minimal obstructions for M_1.
READ FULL TEXT