Strong edge-coloring of graphs with maximum degree 4 using 22 colors DW Cranston Discrete Mathematics 306 (21), 2772-2778, 2006 | 105 | 2006 |
An introduction to the discharging method via graph coloring DW Cranston, DB West Discrete Mathematics 340 (4), 766-793, 2017 | 103* | 2017 |
Regular bipartite graphs are antimagic DW Cranston Journal of Graph Theory 60 (3), 173-182, 2009 | 94 | 2009 |
List‐coloring the square of a subcubic graph DW Cranston, SJ Kim Journal of Graph theory 57 (1), 65-87, 2008 | 71 | 2008 |
Regular graphs of odd degree are antimagic DW Cranston, YC Liang, X Zhu Journal of Graph Theory 80 (1), 28-33, 2015 | 69 | 2015 |
Pebbling and optimal pebbling in graphs DP Bunde, EW Chambers, D Cranston, K Milans, DB West Journal of Graph Theory 57 (3), 215-238, 2008 | 68 | 2008 |
Brooks' theorem and beyond DW Cranston, L Rabern Journal of Graph Theory 80 (3), 199-225, 2015 | 49 | 2015 |
Injective colorings of sparse graphs DW Cranston, SJ Kim, G Yu Discrete mathematics 310 (21), 2965-2973, 2010 | 49 | 2010 |
Injective colorings of graphs with low average degree DW Cranston, SJ Kim, G Yu Algorithmica 60 (3), 553-568, 2011 | 41 | 2011 |
Star coloring of sparse graphs Y Bu, DW Cranston, M Montassier, A Raspaud, W Wang Journal of Graph Theory 62 (3), 201-219, 2009 | 40 | 2009 |
Coloring Claw-Free Graphs with Colors DW Cranston, L Rabern SIAM Journal on Discrete Mathematics 27 (1), 534-549, 2013 | 35 | 2013 |
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid DW Cranston, G Yu arXiv preprint arXiv:1006.3779, 2010 | 32 | 2010 |
Planar graphs of girth at least five are square (Δ+ 2)-choosable M Bonamy, DW Cranston, L Postle Journal of Combinatorial Theory, Series B 134, 218-238, 2019 | 28 | 2019 |
Choosability of the square of a planar graph with maximum degree four DW Cranston, R Erman, R Škrekovski arXiv preprint arXiv:1303.5156, 2013 | 24 | 2013 |
Crossings, colorings, and cliques MO Albertson, DW Cranston, J Fox arXiv preprint arXiv:1006.3783, 2010 | 24 | 2010 |
Odd colorings of sparse graphs DW Cranston arXiv preprint arXiv:2201.01455, 2022 | 20 | 2022 |
Game matching number of graphs DW Cranston, WB Kinnersley, O Suil, DB West Discrete Applied Mathematics 161 (13-14), 1828-1836, 2013 | 20 | 2013 |
Short proofs for cut-and-paste sorting of permutations DW Cranston, IH Sudborough, DB West Discrete Mathematics 307 (22), 2866-2870, 2007 | 20 | 2007 |
Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker DW Cranston, L Rabern arXiv preprint arXiv:1203.5380, 2012 | 19* | 2012 |
A note on odd colorings of 1-planar graphs DW Cranston, M Lafferty, ZX Song Discrete Applied Mathematics 330, 112-117, 2023 | 17 | 2023 |