Minimal obstructions for a matrix partition problem in chordal graphs

DOI10.1016/J.DAM.2022.09.012zbMATH Open1506.05170arXiv2004.01229OpenAlexW3014889307MaRDI QIDQ2097166FDOQ2097166

Juan Carlos García-Altamirano, César Hernández-Cruz

Publication date: 11 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: If $M$ is an $mimesm$ matrix over $0,1,ast$, an $M$-partition of a graph $G$ is a partition $(V_1,dots{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}=ast$. 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 $3imes3$ matrix $M$ over $0,1,ast$, there are finitely many chordal minimal obstructions for the problem of determining whether a graph admits an $M$-partition, except for two matrices, $$ and $$. 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$.

Full work available at URL: https://arxiv.org/abs/2004.01229

Recommendations

• Obstructions to partitions of chordal graphs
• List matrix partitions of chordal graphs
• Partitioning chordal graphs
• Join colourings of chordal graphs
• Matrix partitions of split graphs

zbMATH Keywords

chordal graphforbidden induced subgraph characterizationmatrix partition\(M\)-partition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graph theory
• Partitioning chordal graphs into independent sets and cliques
• Graph partitions with prescribed patterns
• Obstructions to partitions of chordal graphs
• List matrix partitions of chordal graphs
• Polarity of chordal graphs
• Probe split graphs
• Join colourings of chordal graphs

Cited In (3)

• Generalized colouring (matrix partitions) of cographs
• On the characterization of graphs with an equivalence partition number at most three in the class of chordal graphs
• List matrix partitions of chordal graphs

This page was built for publication: Minimal obstructions for a matrix partition problem in chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097166)