Research at ASMSA Based on the DIMACS BioMath Program. - Charles Mullins; Daniel W. Cranston (BioMath in the Schools, 2005)

Strong edge-coloring of graphs with maximum degree 4 using 22 colors. - Daniel W. Cranston (Discret. Math., 2006)

Short proofs for cut-and-paste sorting of permutations. - Daniel W. Cranston; Ivan Hal Sudborough; Douglas B. West (Discret. Math., 2007)

Coloring and Labeling Problems on Graphs - Daniel W. Cranston (2007)

Nomadic decompositions of bidirected complete graphs. - Daniel W. Cranston (Discret. Math., 2008)

Choice number of complete multipartite graphs K3*3, 2*(k-5), 1*2 and K4, 3*2, 2*(k-6), 1*3. - Wenjie He; Lingmin Zhang; Daniel W. Cranston; Yufa Shen; Guoping Zheng (Discret. Math., 2008)

Pebbling and optimal pebbling in graphs. - David P. Bunde; Erin W. Chambers; Daniel W. Cranston; Kevin G. Milans; Douglas B. West (J. Graph Theory, 2008)

List-coloring the square of a subcubic graph. - Daniel W. Cranston; Seog-Jin Kim (J. Graph Theory, 2008)

Crossings, Colorings, and Cliques. - Michael O. Albertson; Daniel W. Cranston; Jacob Fox (Electron. J. Comb., 2009)

A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. - Daniel W. Cranston; Gexin Yu (Electron. J. Comb., 2009)

Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. - Daniel W. Cranston (Discuss. Math. Graph Theory, 2009)

Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. - Daniel W. Cranston (Graphs Comb., 2009)

Star coloring of sparse graphs. - Yuehua Bu; Daniel W. Cranston; Mickaël Montassier; André Raspaud; Weifan Wang 001 (J. Graph Theory, 2009)

Regular bipartite graphs are antimagic. - Daniel W. Cranston (J. Graph Theory, 2009)

Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. - Daniel W. Cranston; Douglas B. West (SIAM J. Discret. Math., 2009)

Injective colorings of sparse graphs. - Daniel W. Cranston; Seog-Jin Kim; Gexin Yu (Discret. Math., 2010)

Injective Colorings of Graphs with Low Average Degree. - Daniel W. Cranston; Seog-Jin Kim; Gexin Yu (Algorithmica, 2011)

Revolutionaries and spies on trees and unicyclic graphs - Daniel W. Cranston; Clifford D. Smyth; Douglas B. West (CoRR, 2011)

Linear choosability of sparse graphs. - Daniel W. Cranston; Gexin Yu (Discret. Math., 2011)

Overlap number of graphs. - Daniel W. Cranston; Nitish Korula; Timothy D. LeSaulnier; Kevin G. Milans; Christopher J. Stocker; Jennifer Vandenbussche; Douglas B. West (J. Graph Theory, 2012)

List Colorings of K5-Minor-Free Graphs With Special List Assignments. - Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt (J. Graph Theory, 2012)

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

On the boundedness of positive solutions of the reciprocal max-type difference equation xn=maxAn-11xn-1, An-12xn-2, ⋯, An-1txn-t with periodic parameters. - Daniel W. Cranston; Candace M. Kent (Appl. Math. Comput., 2013)

New Results in t-Tone Coloring of Graphs. - Daniel W. Cranston; Jaehoon Kim; William B. Kinnersley (Electron. J. Comb., 2013)

Game matching number of graphs. - Daniel W. Cranston; William B. Kinnersley; Suil O; Douglas B. West (Discret. Appl. Math., 2013)

Hamiltonicity in connected regular graphs. - Daniel W. Cranston; Suil O (Inf. Process. Lett., 2013)

Coloring Claw-Free Graphs with Delta-1 Colors. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2013)

Choosability of the square of a planar graph with maximum degree four. - Daniel W. Cranston; Rok Erman; Riste Skrekovski (Australas. J Comb., 2014)

Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5. - Daniel W. Cranston; Riste Skrekovski (Discret. Appl. Math., 2014)

The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. - Daniel W. Cranston; Sogol Jahanbekam; Douglas B. West (Discuss. Math. Graph Theory, 2014)

A Note on Coloring Vertex-transitive Graphs. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2015)

Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. - Daniel W. Cranston; Landon Rabern (Eur. J. Comb., 2015)

Regular Graphs of Odd Degree Are Antimagic. - Daniel W. Cranston; Yu-Chang Liang; Xuding Zhu (J. Graph Theory, 2015)

Brooks' Theorem and Beyond. - Daniel W. Cranston; Landon Rabern (J. Graph Theory, 2015)

Graphs with χ=Δ Have Big Cliques. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2015)

Painting Squares in $ Delta^2-1$ Shades. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2016)

Planar Graphs have Independence Ratio at least 3/13. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2016)

The fractional chromatic number of the plane. - Daniel W. Cranston; Landon Rabern (Comb., 2017)

Beyond Degree Choosability. - Daniel W. Cranston; Landon Rabern (Electron. J. Comb., 2017)

An introduction to the discharging method via graph coloring. - Daniel W. Cranston; Douglas B. West (Discret. Math., 2017)

Modified linear programming and class 0 bounds for graph pebbling. - Daniel W. Cranston; Luke Postle; Chenxiao Xue; Carl Yerger (J. Comb. Optim., 2017)

List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. - Daniel W. Cranston; Bobby Jaeger (J. Graph Theory, 2017)

Subcubic Edge-Chromatic Critical Graphs Have Many Edges. - Daniel W. Cranston; Landon Rabern (J. Graph Theory, 2017)

List-Coloring Claw-Free Graphs with Δ-1 Colors. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2017)

Short Fans and the 5/6 Bound for Line Graphs. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2017)

Edge Lower Bounds for List Critical Graphs, Via Discharging. - Daniel W. Cranston; Landon Rabern (Comb., 2018)

Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5. - Daniel W. Cranston (Electron. J. Comb., 2018)

Planar graphs are 9/2-colorable. - Daniel W. Cranston; Landon Rabern (J. Comb. Theory B, 2018)

A note on bootstrap percolation thresholds in plane tilings using regular polygons. - Neal Bushaw; Daniel W. Cranston (Australas. J Comb., 2019)

Planar graphs of girth at least five are square (Δ + 2)-choosable. - Marthe Bonamy; Daniel W. Cranston; Luke Postle (J. Comb. Theory B, 2019)

A characterization of (4, 2)-choosable graphs. - Daniel W. Cranston (J. Graph Theory, 2019)

Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large. - Daniel W. Cranston (SIAM J. Discret. Math., 2019)

The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. - Daniel W. Cranston; Landon Rabern (SIAM J. Discret. Math., 2019)

The Iterated Local Directed Transitivity Model for Social Networks. - Anthony Bonato; Daniel W. Cranston; Melissa A. Huggan; Trent G. Marbach; Raja Mutharasan (WAW, 2020)

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. - Ilkyoo Choi; Daniel W. Cranston; Théo Pierron (Comb., 2020)

Circular Flows in Planar Graphs. - Daniel W. Cranston; Jiaao Li (SIAM J. Discret. Math., 2020)

Sparse Graphs Are Near-Bipartite. - Daniel W. Cranston; Matthew P. Yancey (SIAM J. Discret. Math., 2020)

Vertex Partitions into an Independent Set and a Forest with Each Component Small. - Daniel W. Cranston; Matthew P. Yancey (SIAM J. Discret. Math., 2021)

Planar Turán Numbers of Cycles: A Counterexample. - Daniel W. Cranston; Bernard Lidický; Xiaonan Liu; Abhinav Shantanam (Electron. J. Comb., 2022)

Strong edge-coloring of cubic bipartite graphs: A counterexample. - Daniel W. Cranston (Discret. Appl. Math., 2022)

On asymptotic packing of geometric graphs. - Daniel W. Cranston; Jiaxi Nie; Jacques Verstraëte; Alexandra Wesolek (Discret. Appl. Math., 2022)

List-recoloring of sparse graphs. - Daniel W. Cranston (Eur. J. Comb., 2022)

In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent. - Daniel W. Cranston; Reem Mahmoud (Eur. J. Comb., 2022)

Coloring ( P 5 , gem ) $({P}_{5}, text{gem})$ -free graphs with Δ - 1 ${ rm{ Delta }}-1$ colors. - Daniel W. Cranston; Hudson Lafayette; Landon Rabern (J. Graph Theory, 2022)

The $t$-tone chromatic number of classes of sparse graphs. - Daniel W. Cranston; Hudson Lafayette (Australas. J Comb., 2023)

A note on odd colorings of 1-planar graphs. - Daniel W. Cranston; Michael Lafferty; Zi-Xia Song (Discret. Appl. Math., 2023)

Kempe equivalent list edge-colorings of planar graphs. - Daniel W. Cranston (Discret. Math., 2023)

Special issue in honour of Landon Rabern. - Brian Rabern; Daniel W. Cranston; Henry A. Kierstead (Discret. Math., 2023)

Kempe Equivalent List Colorings. - Daniel W. Cranston; Reem Mahmoud (Comb., 2024)

A simple quadratic kernel for Token Jumping on surfaces. - Daniel W. Cranston; Moritz Mühlenthaler; Benjamin Peyrille (CoRR, 2024)

Kempe classes and almost bipartite graphs. - Daniel W. Cranston; Carl Feghali (Discret. Appl. Math., 2024)

Bounding clique size in squares of planar graphs. - Daniel W. Cranston (Eur. J. Comb., 2024)

Cliques in squares of graphs with maximum average degree less than 4. - Daniel W. Cranston; Gexin Yu (J. Graph Theory, 2024)

Proper Conflict-Free Coloring of Graphs with Large Maximum Degree. - Daniel W. Cranston; Chun-Hung Liu (SIAM J. Discret. Math., 2024)

Odd-sum colorings of planar graphs. - Daniel W. Cranston (Discret. Appl. Math., 2024)

Optimally reconfiguring list and correspondence colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston (Eur. J. Comb., 2024)

5-Coloring reconfiguration of planar graphs with no short odd cycles. - Daniel W. Cranston; Reem Mahmoud (J. Graph Theory, 2024)

Equitable coloring in 1-planar graphs. - Daniel W. Cranston; Reem Mahmoud (Discret. Math., 2025)

10-list recoloring of planar graphs. - Daniel W. Cranston (Eur. J. Comb., 2025)

Reconfiguration of List Colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. - Nicolas Bousquet; Daniel W. Cranston (CoRR, 2025)