The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size |
scientific article; zbMATH DE number 7655653
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size |
scientific article; zbMATH DE number 7655653 |
Statements
The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (English)
0 references
21 February 2023
0 references
hypergraph
0 references
coloring algorithm
0 references
induced subhypergraph
0 references
matching number
0 references
linear hypergraph
0 references
0 references
0 references
0.9107243
0 references
0 references
0.88615143
0 references
0 references
0 references
0.88359797
0 references
0.8789974
0 references
0.8773004
0 references
0.8772719
0 references
0.87715775
0 references
