Daniel W. Cranston

Daniel W. Cranston, Landon Rabern: Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discrete Math. 27(1): 534-549 (2013)

Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher Stocker, Jennifer Vandenbussche, Douglas B. West: Overlap number of graphs. Journal of Graph Theory 70(1): 10-28 (2012)

Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt: List Colorings of K5-Minor-Free Graphs With Special List Assignments. Journal of Graph Theory 71(1): 18-30 (2012)

Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani: Revolutionaries and spies: Spy-good and spy-bad graphs. Theor. Comput. Sci. 463: 35-53 (2012)

Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani: Revolutionaries and spies: Spy-good and spy-bad graphs. CoRR abs/1202.2910 (2012)

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011)

Daniel W. Cranston, Gexin Yu: Linear choosability of sparse graphs. Discrete Mathematics 311(17): 1910-1917 (2011)

Daniel W. Cranston, Clifford D. Smyth, Douglas B. West: Revolutionaries and spies on trees and unicyclic graphs. CoRR abs/1110.2274 (2011)

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of sparse graphs. Discrete Mathematics 310(21): 2965-2973 (2010)

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of graphs with low average degree. CoRR abs/1006.3776 (2010)

Daniel W. Cranston, Gexin Yu: A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. CoRR abs/1006.3779 (2010)

Michael O. Albertson, Daniel W. Cranston, Jacob Fox: Crossings, Colorings, and Cliques. Electr. J. Comb. 16(1) (2009)

Daniel W. Cranston, Gexin Yu: A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electr. J. Comb. 16(1) (2009)

Daniel W. Cranston: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discussiones Mathematicae Graph Theory 29(1): 163-178 (2009)

Daniel W. Cranston: Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. Graphs and Combinatorics 25(1): 35-40 (2009)

Daniel W. Cranston: Regular bipartite graphs are antimagic. Journal of Graph Theory 60(3): 173-182 (2009)

Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang: Star coloring of sparse graphs. Journal of Graph Theory 62(3): 201-219 (2009)

Daniel W. Cranston, Douglas B. West: Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. SIAM J. Discrete Math. 23(2): 872-881 (2009)

Daniel W. Cranston: Nomadic decompositions of bidirected complete graphs. Discrete Mathematics 308(17): 3982-3985 (2008)

Wenjie He, Lingmin Zhang, Daniel W. Cranston, Yufa Shen, Guoping Zheng: Choice number of complete multipartite graphs K_{3*3, 2*(k-5), 1*2} and K_{4, 3*2, 2*(k-6), 1*3}. Discrete Mathematics 308(23): 5871-5877 (2008)

Daniel W. Cranston, Seog-Jin Kim: List-coloring the square of a subcubic graph. Journal of Graph Theory 57(1): 65-87 (2008)

David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West: Pebbling and optimal pebbling in graphs. Journal of Graph Theory 57(3): 215-238 (2008)

Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West: Short proofs for cut-and-paste sorting of permutations. Discrete Mathematics 307(22): 2866-2870 (2007)

Daniel W. Cranston: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Mathematics 306(21): 2772-2778 (2006)