Mr. Paint and Mrs. Correct go fractional
From MaRDI portal
Publication:551235
zbMath1222.05058MaRDI QIDQ551235
Publication date: 15 July 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222839
Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Towards an on-line version of Ohba's conjecture ⋮ On-line list coloring of matroids ⋮ Critically paintable, choosable or colorable graphs ⋮ Choosability and paintability of the lexicographic product of graphs ⋮ Characterization of \((2m,m)\)-paintable graphs
This page was built for publication: Mr. Paint and Mrs. Correct go fractional
