The following pages link to On-line list colouring of graphs (Q2380291):
Displayed 48 items.
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Indicated coloring of matroids (Q477356) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Sum-paintability of generalized theta-graphs (Q497323) (← 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)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← 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)
- Families of online sum-choice-greedy graphs (Q897232) (← links)
- The Alon-Tarsi number of planar graphs (Q1633764) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- List colouring of graphs and generalized Dyck paths (Q1690249) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- Defective 3-paintability of planar graphs (Q1753126) (← links)
- 3-dynamic coloring of planar triangulations (Q1783610) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- Graph polynomials and group coloring of graphs (Q2122688) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← 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)
- Characterization of \((2m,m)\)-paintable graphs (Q2344816) (← links)
- Locally planar graphs are 5-paintable (Q2346337) (← links)
- Bounds on partial online list colouring (Q2398499) (← links)
- Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability (Q2411512) (← links)
- Online sum-paintability: slow-coloring of trees (Q2416431) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Brooks' theorem on powers of graphs (Q2449134) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Partial Online List Coloring of Graphs (Q2862550) (← links)
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two (Q3462542) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- (Q5047016) (← links)
- (Q5061398) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)
- Separating the online and offline DP-chromatic numbers (Q6117242) (← links)
- Slow coloring of \(3k\)-connected graphs (Q6145826) (← links)
- The Alon-Tarsi number of two kinds of planar graphs (Q6164660) (← links)
- Paintability of complete bipartite graphs (Q6193974) (← links)