Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
Work
Year: 2019
Type: article
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 ‐Sperner hypergraphs to graphs. First, w... more
Source: Journal of Graph Theory
Institutions Rutgers, The State University of New Jersey, National Research University Higher School of Economics, University of Primorska
Cites: 56
Cited by: 8
Related to: 10
FWCI: 1.153
Citation percentile (by year/subfield): 70.46
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Sustainable cities and communities
Open Access status: green