Pages that link to "Item:Q2685343"
From MaRDI portal
The following pages link to The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343):
Displaying 4 items.
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q6383500) (← links)