Three topics in online list coloring
From MaRDI portal
Publication:2448254
DOI10.4310/JOC.2014.v5.n1.a5zbMath1287.05041MaRDI QIDQ2448254
Thomas Mahoney, Gregory J. Puleo, Sarah Loeb, Mu-Tsun Tsai, Douglas B. West, James M. Carraher
Publication date: 30 April 2014
Published in: Journal of Combinatorics (Search for Journal in Brave)
Related Items (11)
Brooks' Theorem and Beyond ⋮ List colouring of graphs and generalized Dyck paths ⋮ Families of online sum-choice-greedy graphs ⋮ Paintability of complete bipartite graphs ⋮ Brooks' theorem on powers of graphs ⋮ An infinite family of sum-paint critical graphs ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Sum-paintability of generalized theta-graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Characterization of \((2m,m)\)-paintable graphs ⋮ Locally planar graphs are 5-paintable
This page was built for publication: Three topics in online list coloring
