Daniel W. Cranston

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 48

Top Topics

Edge Localization

Linear Programming

Independent Set

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

Electron. J. Comb.

Discret. Appl. Math.

Publications

Daniel W. Cranston
Odd-sum colorings of planar graphs. Discret. Appl. Math. 342 (2024)
Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
Optimally reconfiguring list and correspondence colourings. Eur. J. Comb. 115 (2024)
Daniel W. Cranston, Carl Feghali
Kempe classes and almost bipartite graphs. Discret. Appl. Math. 357 (2024)
Daniel W. Cranston
Bounding clique size in squares of planar graphs. Eur. J. Comb. 120 (2024)
Daniel W. Cranston
Token Jumping in Planar Graphs has Linear Sized Kernels. CoRR (2024)
Daniel W. Cranston, Reem Mahmoud
5-Coloring reconfiguration of planar graphs with no short odd cycles. J. Graph Theory 105 (4) (2024)
Daniel W. Cranston, Reem Mahmoud
Kempe Equivalent List Colorings. Comb. 44 (1) (2024)
Daniel W. Cranston, Hudson Lafayette
The $t$-tone chromatic number of classes of sparse graphs. Australas. J Comb. 86 (2023)
Daniel W. Cranston, Michael Lafferty, Zi-Xia Song
A note on odd colorings of 1-planar graphs. Discret. Appl. Math. 330 (2023)
Daniel W. Cranston
Kempe equivalent list edge-colorings of planar graphs. Discret. Math. 346 (11) (2023)
Brian Rabern, Daniel W. Cranston, Henry A. Kierstead
Special issue in honour of Landon Rabern. Discret. Math. 346 (11) (2023)
Daniel W. Cranston
List-recoloring of sparse graphs. Eur. J. Comb. 105 (2022)
Daniel W. Cranston, Reem Mahmoud
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent. Eur. J. Comb. 104 (2022)
Daniel W. Cranston, Bernard Lidický, Xiaonan Liu, Abhinav Shantanam
Planar Turán Numbers of Cycles: A Counterexample. Electron. J. Comb. 29 (3) (2022)
Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte, Alexandra Wesolek
On asymptotic packing of geometric graphs. Discret. Appl. Math. 322 (2022)
Daniel W. Cranston
Strong edge-coloring of cubic bipartite graphs: A counterexample. Discret. Appl. Math. 321 (2022)
Daniel W. Cranston, Hudson Lafayette, Landon Rabern
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. J. Graph Theory 101 (4) (2022)
Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
Optimally Reconfiguring List and Correspondence Colourings. CoRR (2022)
Daniel W. Cranston, Matthew P. Yancey
Vertex Partitions into an Independent Set and a Forest with Each Component Small. SIAM J. Discret. Math. 35 (3) (2021)
Anthony Bonato, Daniel W. Cranston, Melissa A. Huggan, Trent G. Marbach, Raja Mutharasan
The Iterated Local Directed Transitivity Model for Social Networks. WAW (2020)
Daniel W. Cranston, Matthew P. Yancey
Sparse Graphs Are Near-Bipartite. SIAM J. Discret. Math. 34 (3) (2020)
Daniel W. Cranston, Jiaao Li
Circular Flows in Planar Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40 (5) (2020)
Daniel W. Cranston
Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large. SIAM J. Discret. Math. 33 (2) (2019)
Neal Bushaw, Daniel W. Cranston
A note on bootstrap percolation thresholds in plane tilings using regular polygons. Australas. J Comb. 74 (2019)
Daniel W. Cranston, Landon Rabern
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM J. Discret. Math. 33 (3) (2019)
Anthony Bonato, Daniel W. Cranston, Melissa A. Huggan, Trent G. Marbach, Raja Mutharasan
The Iterated Local Directed Transitivity Model for Social Networks. CoRR (2019)
Marthe Bonamy, Daniel W. Cranston, Luke Postle
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory, Ser. B 134 (2019)
Daniel W. Cranston, Matthew P. Yancey
Sparse graphs are near-bipartite. CoRR (2019)
Daniel W. Cranston
A characterization of (4, 2)-choosable graphs. J. Graph Theory 92 (4) (2019)
Daniel W. Cranston, Landon Rabern
Edge Lower Bounds for List Critical Graphs, Via Discharging. Comb. 38 (5) (2018)
Daniel W. Cranston
Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5. Electron. J. Comb. 25 (3) (2018)
Daniel W. Cranston, Landon Rabern
Planar graphs are 9/2-colorable. J. Comb. Theory, Ser. B 133 (2018)
Daniel W. Cranston, Landon Rabern
Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory 86 (1) (2017)
Daniel W. Cranston, Bobby Jaeger
List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. J. Graph Theory 85 (4) (2017)
Daniel W. Cranston, Douglas B. West
An introduction to the discharging method via graph coloring. Discret. Math. 340 (4) (2017)
Daniel W. Cranston, Landon Rabern
Beyond Degree Choosability. Electron. J. Comb. 24 (3) (2017)
Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger
Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. 34 (1) (2017)
Daniel W. Cranston, Landon Rabern
Short Fans and the 5/6 Bound for Line Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Daniel W. Cranston, Landon Rabern
List-Coloring Claw-Free Graphs with Δ-1 Colors. SIAM J. Discret. Math. 31 (2) (2017)
Daniel W. Cranston, Landon Rabern
The fractional chromatic number of the plane. Comb. 37 (5) (2017)
Daniel W. Cranston, Landon Rabern
Planar Graphs have Independence Ratio at least 3/13. Electron. J. Comb. 23 (3) (2016)
Daniel W. Cranston, Landon Rabern
Painting Squares in $\Delta^2-1$ Shades. Electron. J. Comb. 23 (2) (2016)
Daniel W. Cranston, Landon Rabern
Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. 44 (2015)
Daniel W. Cranston, Landon Rabern
Brooks' Theorem and Beyond. J. Graph Theory 80 (3) (2015)
Daniel W. Cranston, Landon Rabern
A Note on Coloring Vertex-transitive Graphs. Electron. J. Comb. 22 (2) (2015)
Daniel W. Cranston, Landon Rabern
Graphs with χ=Δ Have Big Cliques. SIAM J. Discret. Math. 29 (4) (2015)
Daniel W. Cranston, Yu-Chang Liang, Xuding Zhu
Regular Graphs of Odd Degree Are Antimagic. J. Graph Theory 80 (1) (2015)
Daniel W. Cranston, Riste Skrekovski
to be (Δ+1)-choosable, when Δ≥5. Discret. Appl. Math. 162 (2014)
Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. Discuss. Math. Graph Theory 34 (4) (2014)
Daniel W. Cranston, Rok Erman, Riste Skrekovski
Choosability of the square of a planar graph with maximum degree four. Australas. J Comb. 59 (2014)
Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley
New Results in t-Tone Coloring of Graphs. Electron. J. Comb. 20 (2) (2013)
Daniel W. Cranston, Candace M. Kent
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. Appl. Math. Comput. 221 (2013)
Daniel W. Cranston, Suil O
Hamiltonicity in connected regular graphs. Inf. Process. Lett. 113 (22-24) (2013)
Daniel W. Cranston, William B. Kinnersley, Suil O, Douglas B. West
Game matching number of graphs. Discret. Appl. Math. 161 (13-14) (2013)
Daniel W. Cranston, Landon Rabern
Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discret. Math. 27 (1) (2013)
Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt
5-Minor-Free Graphs With Special List Assignments. J. Graph Theory 71 (1) (2012)
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West
Overlap number of graphs. J. Graph Theory 70 (1) (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 (2012)
Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani
Revolutionaries and spies: Spy-good and spy-bad graphs CoRR (2012)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60 (3) (2011)
Daniel W. Cranston, Gexin Yu
Linear choosability of sparse graphs. Discret. Math. 311 (17) (2011)
Daniel W. Cranston, Clifford D. Smyth, Douglas B. West
Revolutionaries and spies on trees and unicyclic graphs CoRR (2011)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective colorings of graphs with low average degree CoRR (2010)
Daniel W. Cranston, Gexin Yu
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid CoRR (2010)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective colorings of sparse graphs. Discret. Math. 310 (21) (2010)
Daniel W. Cranston
Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. Graphs Comb. 25 (1) (2009)
Daniel W. Cranston, Gexin Yu
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electron. J. Comb. 16 (1) (2009)
Michael O. Albertson, Daniel W. Cranston, Jacob Fox
Crossings, Colorings, and Cliques. Electron. J. Comb. 16 (1) (2009)
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
Star coloring of sparse graphs. J. Graph Theory 62 (3) (2009)
Daniel W. Cranston, Douglas B. West
Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. SIAM J. Discret. Math. 23 (2) (2009)
Daniel W. Cranston
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory 29 (1) (2009)
Daniel W. Cranston
Regular bipartite graphs are antimagic. J. Graph Theory 60 (3) (2009)
Daniel W. Cranston, Seog-Jin Kim
List-coloring the square of a subcubic graph. J. Graph Theory 57 (1) (2008)
Wenjie He, Lingmin Zhang, Daniel W. Cranston, Yufa Shen, Guoping Zheng
. Discret. Math. 308 (23) (2008)
Daniel W. Cranston
Nomadic decompositions of bidirected complete graphs. Discret. Math. 308 (17) (2008)
David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West
Pebbling and optimal pebbling in graphs. J. Graph Theory 57 (3) (2008)
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West
Short proofs for cut-and-paste sorting of permutations. Discret. Math. 307 (22) (2007)
Daniel W. Cranston
Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. 306 (21) (2006)
Charles Mullins, Daniel W. Cranston
Research at ASMSA Based on the DIMACS BioMath Program. BioMath in the Schools (2005)