Pages that link to "Item:Q2380445"
From MaRDI portal
The following pages link to Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants (Q2380445):
Displaying 25 items.
- The tournament scheduling problem with absences (Q323410) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- Graph polynomials and group coloring of graphs (Q2122688) (← links)
- An infinite family of sum-paint critical graphs (Q2227994) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) (Q2305911) (← links)
- Beyond degree choosability (Q2401410) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Relation between the correspondence chromatic number and the Alon-Tarsi number (Q2699913) (← links)
- Partial online list coloring of graphs (Q2862550) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Paintability of complete bipartite graphs (Q6193974) (← links)
- Toroidal graphs without \(K_5^-\) and 6-cycles (Q6553178) (← links)
