Pages that link to "Item:Q612968"
From MaRDI portal
The following pages link to A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs (Q612968):
Displaying 21 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)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Chip games and paintability (Q726662) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- The Alon-Tarsi number of planar graphs (Q1633764) (← links)
- Computing the list chromatic index of graphs (Q1711669) (← links)
- Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
- Locally planar graphs are 5-paintable (Q2346337) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Partial online list coloring of graphs (Q2862550) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Constructing integer-magic graphs via the Combinatorial Nullstellensatz (Q5045258) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
- Network Capacity Bound for Personalized PageRank in Multimodal Networks (Q6094516) (← links)
- The Alon-Tarsi number of two kinds of planar graphs (Q6164660) (← links)
