☰

Daniel W. Cranston, Ph.D. - Publications

Affiliations: 
2007 University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

52 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Cranston DW, Yancey MP. Sparse Graphs Are Near-Bipartite Siam Journal On Discrete Mathematics. 34: 1725-1768. DOI: 10.1137/19M1299712  0.58
2020 Choi I, Cranston DW, Pierron T. Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles Combinatorica. 1-29. DOI: 10.1007/S00493-019-4014-3  0.669
2019 Cranston DW, Rabern L. The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 Siam Journal On Discrete Mathematics. 33: 1228-1241. DOI: 10.1137/18M117056X  0.688
2019 Cranston DW. Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large Siam Journal On Discrete Mathematics. 33: 614-628. DOI: 10.1137/17M1158355  0.638
2019 Bonamy M, Cranston DW, Postle L. Planar graphs of girth at least five are square (Δ + 2)-choosable Journal of Combinatorial Theory, Series B. 134: 218-238. DOI: 10.1016/J.Jctb.2018.06.005  0.586
2019 Cranston DW. A characterization of (4,2)‐choosable graphs Journal of Graph Theory. 92: 460-487. DOI: 10.1002/Jgt.22464  0.575
2018 Cranston DW. Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5 Electronic Journal of Combinatorics. 25: 3-5. DOI: 10.37236/7170  0.655
2018 Cranston DW, Rabern L. Planar graphs are 9/2-colorable Journal of Combinatorial Theory, Series B. 133: 32-45. DOI: 10.1016/J.Jctb.2018.04.002  0.66
2018 Cranston DW, Rabern L. Edge Lower Bounds for List Critical Graphs, via Discharging Combinatorica. 38: 1045-1065. DOI: 10.1007/S00493-016-3584-6  0.641
2017 Cranston DW, Rabern L. Beyond Degree Choosability Electronic Journal of Combinatorics. 24: 3-29. DOI: 10.37236/6179  0.697
2017 Cranston DW, Rabern L. Short Fans and the 5/6 Bound for Line Graphs Siam Journal On Discrete Mathematics. 31: 2039-2063. DOI: 10.1137/16M1099030  0.663
2017 Cranston DW, West DB. An introduction to the discharging method via graph coloring Discrete Mathematics. 340: 766-793. DOI: 10.1016/J.Disc.2016.11.022  0.596
2017 Cranston DW, Rabern L. The fractional chromatic number of the plane Combinatorica. 37: 837-861. DOI: 10.1007/S00493-016-3380-3  0.409
2017 Cranston DW, Rabern L. Subcubic Edge-Chromatic Critical Graphs Have Many Edges Journal of Graph Theory. 86: 122-136. DOI: 10.1002/Jgt.22116  0.665
2017 Cranston DW, Jaeger B. List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles Journal of Graph Theory. 85: 721-737. DOI: 10.1002/Jgt.22101  0.541
2016 Cranston DW, Rabern L. Planar Graphs have Independence Ratio at least 3/13 Electronic Journal of Combinatorics. 23: 3-45. DOI: 10.37236/5309  0.513
2016 Cranston DW, Rabern L. Painting Squares in $\Delta^2-1$ Shades Electronic Journal of Combinatorics. 23: 2-50. DOI: 10.37236/4978  0.694
2016 Cranston DW, Postle L, Xue C, Yerger C. Modified linear programming and class 0 bounds for graph pebbling Journal of Combinatorial Optimization. 1-19. DOI: 10.1007/S10878-016-0060-6  0.639
2015 Cranston DW, Rabern L. A note on coloring vertex-transitive graphs Electronic Journal of Combinatorics. 22. DOI: 10.37236/4626  0.557
2015 Cranston DW, Rabern L. Graphs with χ = Δ have big cliques Siam Journal On Discrete Mathematics. 29: 1792-1814. DOI: 10.1137/130929515  0.653
2015 Cranston DW, Rabern L. Coloring a graph with δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker European Journal of Combinatorics. 44: 23-42. DOI: 10.1016/J.Ejc.2014.09.006  0.608
2015 Cranston DW, Rabern L. Brooks' Theorem and beyond Journal of Graph Theory. 80: 199-225. DOI: 10.1002/Jgt.21847  0.452
2015 Cranston DW, Liang YC, Zhu X. Regular Graphs of Odd Degree Are Antimagic Journal of Graph Theory. 80: 28-33. DOI: 10.1002/Jgt.21836  0.63
2014 Cranston DW, Jahanbekam S, West DB. The 1, 2, 3-conjecture and 1, 2-conjecture for sparse graphs Discussiones Mathematicae - Graph Theory. 34: 769-799. DOI: 10.7151/Dmgt.1768  0.65
2014 Cranston DW, Škrekovski R. Sufficient sparseness conditions for G2 to be (Δ + 1) -choosable, when Δ ≥ 5 Discrete Applied Mathematics. 162: 167-176. DOI: 10.1016/J.Dam.2013.08.025  0.626
2014 Cranston DW, Erman R, Škrekovski R. Choosability of the square of a planar graph with maximum degree four Australasian Journal of Combinatorics. 59: 86-97.  0.597
2013 Cranston DW, Kim J, Kinnersley WB. New results in t-tone coloring of graphs Electronic Journal of Combinatorics. 20. DOI: 10.37236/2710  0.565
2013 Cranston DW, Rabern L. List-Coloring Claw-Free Graphs with $\Delta-1$ Colors Siam Journal On Discrete Mathematics. 27: 534-549. DOI: 10.1137/15M1051774  0.664
2013 Cranston DW, Rabern L. Coloring claw-free graphs with δ-1 colors Siam Journal On Discrete Mathematics. 27: 534-549. DOI: 10.1137/12088015X  0.607
2013 Cranston DW, Suil O. Hamiltonicity in connected regular graphs Information Processing Letters. 113: 858-860. DOI: 10.1016/J.Ipl.2013.08.005  0.551
2013 Cranston DW, Kinnersley WB, Suil O, West DB. Game matching number of graphs Discrete Applied Mathematics. 161: 1828-1836. DOI: 10.1016/J.Dam.2013.03.010  0.749
2012 Cranston DW, Kinnersley WB, Milans KG, Puleo GJ, West DB. Chain-making games in grid-like posets The Journal of Combinatorics. 3: 633-649. DOI: 10.4310/Joc.2012.V3.N4.A3  0.671
2012 Cranston DW, Smyth CD, West DB. Revolutionaries and spies on trees and unicyclic graphs The Journal of Combinatorics. 3: 195-205. DOI: 10.4310/Joc.2012.V3.N2.A4  0.757
2012 Butterfield JV, Cranston DW, Puleo GJ, West DB, Zamani R. Revolutionaries and spies: Spy-good and spy-bad graphs Theoretical Computer Science. 463: 35-53. DOI: 10.1016/J.Tcs.2012.05.041  0.626
2012 Cranston DW, Pruchnewski A, Tuza Z, Voigt M. List colorings of K 5-minor-free graphs with special list assignments Journal of Graph Theory. 71: 18-30. DOI: 10.1002/Jgt.20628  0.619
2012 Cranston DW, Korula N, Lesaulnier TD, Milans KG, Stocker CJ, Vandenbussche J, West DB. Overlap number of graphs Journal of Graph Theory. 70: 10-28. DOI: 10.1002/Jgt.20596  0.612
2011 Cranston DW, Yu G. Linear choosability of sparse graphs Discrete Mathematics. 311: 1910-1917. DOI: 10.1016/J.Disc.2011.05.017  0.66
2011 Cranston DW, Kim SJ, Yu G. Injective colorings of graphs with low average degree Algorithmica (New York). 60: 553-568. DOI: 10.1007/S00453-010-9425-X  0.664
2010 Cranston DW, Kim SJ, Yu G. Injective colorings of sparse graphs Discrete Mathematics. 310: 2965-2973. DOI: 10.1016/J.Disc.2010.07.003  0.664
2009 Cranston DW. Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles Discussiones Mathematicae - Graph Theory. 29: 163-178. DOI: 10.7151/Dmgt.1438  0.682
2009 Cranston DW, Yu G. A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid Electronic Journal of Combinatorics. 16. DOI: 10.37236/202  0.509
2009 Albertson MO, Cranston DW, Fox J. Crossings, colorings, and cliques Electronic Journal of Combinatorics. 16: 45. DOI: 10.37236/134  0.583
2009 Cranston DW, West DB. Classes of 3-regular graphs that are (7, 2)-edge-choosable Siam Journal On Discrete Mathematics. 23: 872-881. DOI: 10.1137/080716335  0.672
2009 Cranston DW. Multigraphs with Δ ≥ 3 are totally-(2Δ-1)-choosable Graphs and Combinatorics. 25: 35-40. DOI: 10.1007/s00373-008-0817-5  0.513
2009 Bu Y, Cranston DW, Montassier M, Raspaud A, Wang W. Star coloring of sparse graphs Journal of Graph Theory. 62: 201-219. DOI: 10.1002/Jgt.V62:3  0.682
2009 Cranston DW. Regular bipartite graphs are antimagic Journal of Graph Theory. 60: 173-182. DOI: 10.1002/Jgt.V60:3  0.642
2009 Albertson MO, Cranston DW, Fox J. Crossings, colorings, and cliques Electronic Journal of Combinatorics. 16.  0.49
2008 He W, Zhang L, Cranston DW, Shen Y, Zheng G. Choice number of complete multipartite graphs K3 * 3, 2 * (k - 5), 1 * 2 and K4, 3 * 2, 2 * (k - 6), 1 * 3 Discrete Mathematics. 308: 5871-5877. DOI: 10.1016/J.Disc.2007.10.046  0.506
2008 Cranston DW. Nomadic decompositions of bidirected complete graphs Discrete Mathematics. 308: 3982-3985. DOI: 10.1016/J.Disc.2007.07.023  0.457
2008 Cranston DW, Kim SJ. List-coloring the square of a subcubic graph Journal of Graph Theory. 57: 65-87. DOI: 10.1002/jgt.20273  0.629
2007 Cranston DW, Sudborough IH, West DB. Short proofs for cut-and-paste sorting of permutations Discrete Mathematics. 307: 2866-2870. DOI: 10.1016/J.Disc.2007.01.011  0.531
2006 Cranston DW. Strong edge-coloring of graphs with maximum degree 4 using 22 colors Discrete Mathematics. 306: 2772-2778. DOI: 10.1016/J.Disc.2006.03.053  0.512
Show low-probability matches.