Pages that link to "Item:Q2387187"
From MaRDI portal
The following pages link to Hypergraph extension of the Alon-Tarsi list coloring theorem (Q2387187):
Displaying 8 items.
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs (Q2334069) (← links)
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants (Q2380445) (← links)
- Beyond degree choosability (Q2401410) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- On list coloring Steiner triple systems (Q3578155) (← links)