Pages that link to "Item:Q3603480"
From MaRDI portal
The following pages link to Properly 2-Colouring Linear Hypergraphs (Q3603480):
Displaying 3 items.
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
