Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs (Q5066894)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7500664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs |
scientific article; zbMATH DE number 7500664 |
Statements
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs (English)
0 references
31 March 2022
0 references
1-Sperner hypergraph
0 references
bounded clique-width
0 references
split
0 references
bipartite
0 references
and cobipartite graphs
0 references
threshold graphs
0 references
vertex cover
0 references
clique
0 references
dominating set
0 references
and closed neighborhood hypergraphs
0 references
0.8813924193382263
0 references
0.7400286197662354
0 references
