Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

arXiv1805.03405MaRDI QIDQ6301360FDOQ6301360

Authors: Endre Boros, Vladimir Gurvich, Martin Milanič 

Publication date: 9 May 2018

Abstract: A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we consider the classical characterizations of threshold and domishold graphs and use them to obtain further characterizations of these classes in terms of $1$-Spernerness, thresholdness, and $2$-asummability of their vertex cover, clique, dominating set, and closed neighborhood hypergraphs. Furthermore, we apply a decomposition property of $1$-Sperner hypergraphs to derive decomposition theorems for two classes of split graphs, a class of bipartite graphs, and a class of cobipartite graphs. These decomposition theorems are based on certain matrix partitions of the corresponding graphs, giving rise to new classes of graphs of bounded clique-width and new polynomially solvable cases of several domination problems.

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

This page was built for publication: Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

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