The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q6383500)
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
| 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 |
Statements
19 November 2021
0 references
math.CO
0 references
