The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2023.113342 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2023.113342 / rank | |||
Normal rank | |||
Latest revision as of 18:13, 19 December 2024
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
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
