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

DOI10.1002/jgt.22529zbMath1485.05121OpenAlexW2992939139WikidataQ126665741 ScholiaQ126665741MaRDI QIDQ5066894

Martin Milanič, Endre Boros, Vladimir A. Gurvich

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22529

zbMATH Keywords

bipartitecliquedominating setvertex coversplitthreshold graphsbounded clique-width1-Sperner hypergraphand closed neighborhood hypergraphsand cobipartite graphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Graph parameters, implicit representations and factorial properties ⋮ Graph parameters, implicit representations and factorial properties ⋮ Combinatorics and algorithms for quasi-chain graphs ⋮ Decomposing 1-Sperner hypergraphs

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