Mr. Paint and Mrs. Correct

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/233824

zbMATH Keywords

colorability paintability coloring game coloring theorems graph, coloring problem

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

List rankings and on-line list rankings of graphs ⋮ Graph polynomials and group coloring of graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ Painting squares in $\Delta^2-1$ shades ⋮ The Alon-Tarsi number of planar graphs ⋮ The tournament scheduling problem with absences ⋮ Bounds on the game transversal number in hypergraphs ⋮ Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two ⋮ 3-Paintability of planar graphs ⋮ Paired-Domination Game Played in Graphs ⋮ Bounds on partial online list colouring ⋮ Every planar graph is 1-defective $(9,2)$-paintable ⋮ Beyond degree choosability ⋮ Strengthening $(a,b)$-choosability results to $(a,b)$-paintability ⋮ Dynamic coloring parameters for graphs with given genus ⋮ List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ Online sum-paintability: slow-coloring of trees ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ The list chromatic index of simple graphs whose odd cycles intersect in at most one edge ⋮ List colouring of graphs and generalized Dyck paths ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ Families of online sum-choice-greedy graphs ⋮ Separating the online and offline DP-chromatic numbers ⋮ The Alon–Tarsi number of planar graphs revisited ⋮ Slow coloring of $3k$-connected graphs ⋮ On-line DP-coloring of graphs ⋮ Bichromatic coloring game on triangulations ⋮ Online sum-paintability: the slow-coloring game ⋮ Paintability of complete bipartite graphs ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ Computing the list chromatic index of graphs ⋮ Towards an on-line version of Ohba's conjecture ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Brooks' theorem on powers of graphs ⋮ Indicated coloring of matroids ⋮ An infinite family of sum-paint critical graphs ⋮ On-line choice number of complete multipartite graphs: an algorithmic approach ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ On-line list colouring of random graphs ⋮ Sum-paintability of generalized theta-graphs ⋮ Unnamed Item ⋮ On-line list coloring of matroids ⋮ A better lower bound on average degree of online $k$-list-critical graphs ⋮ Defective 3-paintability of planar graphs ⋮ Unnamed Item ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ 3-dynamic coloring of planar triangulations ⋮ Choosability and paintability of the lexicographic product of graphs ⋮ Chip games and paintability ⋮ Improved lower bounds on the number of edges in list critical and online list critical graphs ⋮ Locally planar graphs are 2-defective 4-paintable ⋮ On the choice number of complete multipartite graphs with part size four ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ The generalized matcher game ⋮ Partial Online List Coloring of Graphs ⋮ Characterization of $(2m,m)$-paintable graphs ⋮ Locally planar graphs are 5-paintable ⋮ The polynomial method for list-colouring extendability of outerplanar graphs

This page was built for publication: Mr. Paint and Mrs. Correct