Daniel W. Cranston

91 papers A 1B 1C 1Journal 86Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. STACS Nicolas Bousquet, Daniel W. Cranston
2026	J	`jnl`	Sharp Bounds on Lengths of Linear Recolouring Sequences. Electron. J. Comb. Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
2025	J	`jnl`	10-list recoloring of planar graphs. Eur. J. Comb. Daniel W. Cranston
2025	J	`jnl`	A Linear Kernel for Independent Set Reconfiguration in Planar Graphs. CoRR Nicolas Bousquet, Daniel W. Cranston
2025	B	`conf`	A Simple Quadratic Kernel for Token Jumping on Surfaces. WG Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
2025	J	`jnl`	Equitable coloring in 1-planar graphs. Discret. Math. Daniel W. Cranston, Reem Mahmoud
2025	J	`jnl`	List Packing and Correspondence Packing of Planar Graphs. J. Graph Theory Daniel W. Cranston, Evelyne Smith-Roberge
2025	J	`jnl`	Reconfiguration of List Colourings. CoRR Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston, Jan van den Heuvel, Ross J. Kang
2024	J	`jnl`	5-Coloring reconfiguration of planar graphs with no short odd cycles. J. Graph Theory Daniel W. Cranston, Reem Mahmoud
2024	J	`jnl`	A simple quadratic kernel for Token Jumping on surfaces. CoRR Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
2024	J	`jnl`	Bounding clique size in squares of planar graphs. Eur. J. Comb. Daniel W. Cranston
2024	J	`jnl`	Cliques in squares of graphs with maximum average degree less than 4. J. Graph Theory Daniel W. Cranston, Gexin Yu
2024	J	`jnl`	Kempe Equivalent List Colorings. Comb. Daniel W. Cranston, Reem Mahmoud
2024	J	`jnl`	Kempe classes and almost bipartite graphs. Discret. Appl. Math. Daniel W. Cranston, Carl Feghali
2024	J	`jnl`	Odd-sum colorings of planar graphs. Discret. Appl. Math. Daniel W. Cranston
2024	J	`jnl`	Optimally reconfiguring list and correspondence colourings. Eur. J. Comb. Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
2024	J	`jnl`	Proper Conflict-Free Coloring of Graphs with Large Maximum Degree. SIAM J. Discret. Math. Daniel W. Cranston, Chun-Hung Liu
2023	J	`jnl`	A note on odd colorings of 1-planar graphs. Discret. Appl. Math. Daniel W. Cranston, Michael Lafferty, Zi-Xia Song
2023	J	`jnl`	Kempe equivalent list edge-colorings of planar graphs. Discret. Math. Daniel W. Cranston
2023	J	`jnl`	Special issue in honour of Landon Rabern. Discret. Math. Brian Rabern, Daniel W. Cranston, Henry A. Kierstead
2023	J	`jnl`	The $t$-tone chromatic number of classes of sparse graphs. Australas. J Comb. Daniel W. Cranston, Hudson LaFayette
2022	J	`jnl`	Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. J. Graph Theory Daniel W. Cranston, Hudson LaFayette, Landon Rabern
2022	J	`jnl`	In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent. Eur. J. Comb. Daniel W. Cranston, Reem Mahmoud
2022	J	`jnl`	List-recoloring of sparse graphs. Eur. J. Comb. Daniel W. Cranston
2022	J	`jnl`	On asymptotic packing of geometric graphs. Discret. Appl. Math. Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte, Alexandra Wesolek
2022	J	`jnl`	Optimally Reconfiguring List and Correspondence Colourings. CoRR Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston
2022	J	`jnl`	Planar Turán Numbers of Cycles: A Counterexample. Electron. J. Comb. Daniel W. Cranston, Bernard Lidický, Xiaonan Liu, Abhinav Shantanam
2022	J	`jnl`	Strong edge-coloring of cubic bipartite graphs: A counterexample. Discret. Appl. Math. Daniel W. Cranston
2021	J	`jnl`	Vertex Partitions into an Independent Set and a Forest with Each Component Small. SIAM J. Discret. Math. Daniel W. Cranston, Matthew P. Yancey
2020	J	`jnl`	Circular Flows in Planar Graphs. SIAM J. Discret. Math. Daniel W. Cranston, Jiaao Li
2020	J	`jnl`	Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
2020	J	`jnl`	Sparse Graphs Are Near-Bipartite. SIAM J. Discret. Math. Daniel W. Cranston, Matthew P. Yancey
2020	C	`conf`	The Iterated Local Directed Transitivity Model for Social Networks. WAW Anthony Bonato, Daniel W. Cranston, Melissa A. Huggan, Trent G. Marbach, Raja Mutharasan
2019	J	`jnl`	A characterization of (4, 2)-choosable graphs. J. Graph Theory Daniel W. Cranston
2019	J	`jnl`	A note on bootstrap percolation thresholds in plane tilings using regular polygons. Australas. J Comb. Neal Bushaw, Daniel W. Cranston
2019	J	`jnl`	Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large. SIAM J. Discret. Math. Daniel W. Cranston
2019	J	`jnl`	Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory B Marthe Bonamy, Daniel W. Cranston, Luke Postle
2019	J	`jnl`	Sparse graphs are near-bipartite. CoRR Daniel W. Cranston, Matthew P. Yancey
2019	J	`jnl`	The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM J. Discret. Math. Daniel W. Cranston, Landon Rabern
2019	J	`jnl`	The Iterated Local Directed Transitivity Model for Social Networks. CoRR Anthony Bonato, Daniel W. Cranston, Melissa A. Huggan, Trent G. Marbach, Raja Mutharasan
2018	J	`jnl`	Edge Lower Bounds for List Critical Graphs, Via Discharging. Comb. Daniel W. Cranston, Landon Rabern
2018	J	`jnl`	Planar graphs are 9/2-colorable. J. Comb. Theory B Daniel W. Cranston, Landon Rabern
2018	J	`jnl`	Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5. Electron. J. Comb. Daniel W. Cranston
2017	J	`jnl`	An introduction to the discharging method via graph coloring. Discret. Math. Daniel W. Cranston, Douglas B. West
2017	J	`jnl`	Beyond Degree Choosability. Electron. J. Comb. Daniel W. Cranston, Landon Rabern
2017	J	`jnl`	List-Coloring Claw-Free Graphs with Δ-1 Colors. SIAM J. Discret. Math. Daniel W. Cranston, Landon Rabern
2017	J	`jnl`	List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. J. Graph Theory Daniel W. Cranston, Bobby Jaeger
2017	J	`jnl`	Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger
2017	J	`jnl`	Short Fans and the 5/6 Bound for Line Graphs. SIAM J. Discret. Math. Daniel W. Cranston, Landon Rabern
2017	J	`jnl`	Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory Daniel W. Cranston, Landon Rabern
2017	J	`jnl`	The fractional chromatic number of the plane. Comb. Daniel W. Cranston, Landon Rabern
2016	J	`jnl`	Painting Squares in $\Delta^2-1$ Shades. Electron. J. Comb. Daniel W. Cranston, Landon Rabern
2016	J	`jnl`	Planar Graphs have Independence Ratio at least 3/13. Electron. J. Comb. Daniel W. Cranston, Landon Rabern
2015	J	`jnl`	A Note on Coloring Vertex-transitive Graphs. Electron. J. Comb. Daniel W. Cranston, Landon Rabern
2015	J	`jnl`	Brooks' Theorem and Beyond. J. Graph Theory Daniel W. Cranston, Landon Rabern
2015	J	`jnl`	Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. Daniel W. Cranston, Landon Rabern
2015	J	`jnl`	Graphs with χ=Δ Have Big Cliques. SIAM J. Discret. Math. Daniel W. Cranston, Landon Rabern
2015	J	`jnl`	Regular Graphs of Odd Degree Are Antimagic. J. Graph Theory Daniel W. Cranston, Yu-Chang Liang, Xuding Zhu
2014	J	`jnl`	Choosability of the square of a planar graph with maximum degree four. Australas. J Comb. Daniel W. Cranston, Rok Erman, Riste Skrekovski
2014	J	`jnl`	Sufficient sparseness conditions for G Discret. Appl. Math. Daniel W. Cranston, Riste Skrekovski
2014	J	`jnl`	The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. Discuss. Math. Graph Theory Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West
2013	J	`jnl`	Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discret. Math. Daniel W. Cranston, Landon Rabern
2013	J	`jnl`	Game matching number of graphs. Discret. Appl. Math. Daniel W. Cranston, William B. Kinnersley, Suil O, Douglas B. West
2013	J	`jnl`	Hamiltonicity in connected regular graphs. Inf. Process. Lett. Daniel W. Cranston, Suil O
2013	J	`jnl`	New Results in t-Tone Coloring of Graphs. Electron. J. Comb. Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley
2013	J	`jnl`	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. Daniel W. Cranston, Candace M. Kent
2012	J	`jnl`	List Colorings of J. Graph Theory Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt
2012	J	`jnl`	Overlap number of graphs. J. Graph Theory Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West
2012	J	`jnl`	Revolutionaries and spies: Spy-good and spy-bad graphs CoRR Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani
2012	J	`jnl`	Revolutionaries and spies: Spy-good and spy-bad graphs. Theor. Comput. Sci. Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani
2011	J	`jnl`	Injective Colorings of Graphs with Low Average Degree. Algorithmica Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2011	J	`jnl`	Linear choosability of sparse graphs. Discret. Math. Daniel W. Cranston, Gexin Yu
2011	J	`jnl`	Revolutionaries and spies on trees and unicyclic graphs CoRR Daniel W. Cranston, Clifford D. Smyth, Douglas B. West
2010	J	`jnl`	A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid CoRR Daniel W. Cranston, Gexin Yu
2010	J	`jnl`	Injective colorings of graphs with low average degree CoRR Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2010	J	`jnl`	Injective colorings of sparse graphs. Discret. Math. Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2009	J	`jnl`	A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electron. J. Comb. Daniel W. Cranston, Gexin Yu
2009	J	`jnl`	Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. SIAM J. Discret. Math. Daniel W. Cranston, Douglas B. West
2009	J	`jnl`	Crossings, Colorings, and Cliques. Electron. J. Comb. Michael O. Albertson, Daniel W. Cranston, Jacob Fox
2009	J	`jnl`	Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory Daniel W. Cranston
2009	J	`jnl`	Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. Graphs Comb. Daniel W. Cranston
2009	J	`jnl`	Regular bipartite graphs are antimagic. J. Graph Theory Daniel W. Cranston
2009	J	`jnl`	Star coloring of sparse graphs. J. Graph Theory Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang
2008	J	`jnl`	Choice number of complete multipartite graphs K Discret. Math. Wenjie He, Lingmin Zhang, Daniel W. Cranston, Yufa Shen, Guoping Zheng
2008	J	`jnl`	List-coloring the square of a subcubic graph. J. Graph Theory Daniel W. Cranston, Seog-Jin Kim
2008	J	`jnl`	Nomadic decompositions of bidirected complete graphs. Discret. Math. Daniel W. Cranston
2008	J	`jnl`	Pebbling and optimal pebbling in graphs. J. Graph Theory David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West
2007	—	`—`	Coloring and Labeling Problems on Graphs Daniel W. Cranston
2007	J	`jnl`	Short proofs for cut-and-paste sorting of permutations. Discret. Math. Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West
2006	J	`jnl`	Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. Daniel W. Cranston
2005	—	`conf`	Research at ASMSA Based on the DIMACS BioMath Program. BioMath in the Schools Charles Mullins, Daniel W. Cranston