Daniel W. Cranston, Ph.D.
Affiliations: | 2007 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Daniel Cranston"Parents
Sign in to add mentorDouglas B. West | grad student | 2007 | UIUC | |
(Coloring and labeling problems on graphs.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Cranston DW, Yancey MP. (2020) Sparse Graphs Are Near-Bipartite Siam Journal On Discrete Mathematics. 34: 1725-1768 |
Choi I, Cranston DW, Pierron T. (2020) Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles Combinatorica. 1-29 |
Cranston DW, Rabern L. (2019) The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 Siam Journal On Discrete Mathematics. 33: 1228-1241 |
Cranston DW. (2019) Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large Siam Journal On Discrete Mathematics. 33: 614-628 |
Bonamy M, Cranston DW, Postle L. (2019) Planar graphs of girth at least five are square (Δ + 2)-choosable Journal of Combinatorial Theory, Series B. 134: 218-238 |
Cranston DW. (2019) A characterization of (4,2)‐choosable graphs Journal of Graph Theory. 92: 460-487 |
Cranston DW. (2018) Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5 Electronic Journal of Combinatorics. 25: 3-5 |
Cranston DW, Rabern L. (2018) Planar graphs are 9/2-colorable Journal of Combinatorial Theory, Series B. 133: 32-45 |
Cranston DW, Rabern L. (2018) Edge Lower Bounds for List Critical Graphs, via Discharging Combinatorica. 38: 1045-1065 |
Cranston DW, Rabern L. (2017) Beyond Degree Choosability Electronic Journal of Combinatorics. 24: 3-29 |