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

DOI10.1002/JGT.22529MaRDI QIDQ5066894zbMATH OpenOpenAlexWikidataFDO

Authors Endre Boros, Martin Milanič, Vladimir 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

1-Sperner hypergraphand closed neighborhood hypergraphsand cobipartite graphsbipartitebounded clique-widthcliquedominating setsplitthreshold graphsvertex cover

Mathematics Subject Classification ID

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

Recommendations

• Decomposing 1-Sperner hypergraphs
• Split Hypergraphs
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
• scientific article; zbMATH DE number 2191976
• Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs

Cited in

(7)

• Graph parameters, implicit representations and factorial properties
• Decomposing 1-Sperner hypergraphs
• Split Hypergraphs
• H-product of graphs, H-threshold graphs and threshold-width of graphs
• Combinatorics and algorithms for quasi-chain graphs
• Graph parameters, implicit representations and factorial properties
• Hypergraphs with polynomial representation: introducing \(r\)-splits

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 Q5066894)