default search action
Daniel W. Cranston
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j71]Daniel W. Cranston, Reem Mahmoud:
Equitable coloring in 1-planar graphs. Discret. Math. 348(2): 114286 (2025) - 2024
- [j70]Daniel W. Cranston, Reem Mahmoud:
Kempe Equivalent List Colorings. Comb. 44(1): 125-153 (2024) - [j69]Daniel W. Cranston
:
Odd-sum colorings of planar graphs. Discret. Appl. Math. 342: 82-88 (2024) - [j68]Daniel W. Cranston
Kempe classes and almost bipartite graphs. Discret. Appl. Math. 357: 94-98 (2024) - [j67]Stijn Cambie
Optimally reconfiguring list and correspondence colourings. Eur. J. Comb. 115: 103798 (2024) - [j66]Daniel W. Cranston:
Bounding clique size in squares of planar graphs. Eur. J. Comb. 120: 103960 (2024) - [j65]Daniel W. Cranston
5-Coloring reconfiguration of planar graphs with no short odd cycles. J. Graph Theory 105(4): 670-679 (2024) - [i8]Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille:
A simple quadratic kernel for Token Jumping on surfaces. CoRR abs/2408.04743 (2024) - 2023
- [j64]Daniel W. Cranston, Hudson Lafayette:
The $t$-tone chromatic number of classes of sparse graphs. Australas. J Comb. 86: 458-476 (2023) - [j63]Daniel W. Cranston
A note on odd colorings of 1-planar graphs. Discret. Appl. Math. 330: 112-117 (2023) - [j62]Daniel W. Cranston
Kempe equivalent list edge-colorings of planar graphs. Discret. Math. 346(11): 113180 (2023) - [j61]Brian Rabern, Daniel W. Cranston
Special issue in honour of Landon Rabern. Discret. Math. 346(11): 113507 (2023) - 2022
- [j60]Daniel W. Cranston
Planar Turán Numbers of Cycles: A Counterexample. Electron. J. Comb. 29(3) (2022) - [j59]Daniel W. Cranston
Strong edge-coloring of cubic bipartite graphs: A counterexample. Discret. Appl. Math. 321: 258-260 (2022) - [j58]Daniel W. Cranston
On asymptotic packing of geometric graphs. Discret. Appl. Math. 322: 142-152 (2022) - [j57]Daniel W. Cranston
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent. Eur. J. Comb. 104: 103532 (2022) - [j56]Daniel W. Cranston
List-recoloring of sparse graphs. Eur. J. Comb. 105: 103562 (2022) - [j55]Daniel W. Cranston
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. J. Graph Theory 101(4): 633-642 (2022) - [i7]Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston:
Optimally Reconfiguring List and Correspondence Colourings. CoRR abs/2204.07928 (2022) - 2021
- [j54]Daniel W. Cranston
Vertex Partitions into an Independent Set and a Forest with Each Component Small. SIAM J. Discret. Math. 35(3): 1769-1791 (2021) - 2020
- [j53]Ilkyoo Choi, Daniel W. Cranston
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40(5): 625-653 (2020) - [j52]Daniel W. Cranston
Circular Flows in Planar Graphs. SIAM J. Discret. Math. 34(1): 497-519 (2020) - [j51]Daniel W. Cranston
Sparse Graphs Are Near-Bipartite. SIAM J. Discret. Math. 34(3): 1725-1768 (2020) - [c2]Anthony Bonato, Daniel W. Cranston
The Iterated Local Directed Transitivity Model for Social Networks. WAW 2020: 111-123
2010 – 2019
- 2019
- [j50]Neal Bushaw, Daniel W. Cranston:
A note on bootstrap percolation thresholds in plane tilings using regular polygons. Australas. J Comb. 74: 486-497 (2019) - [j49]Marthe Bonamy, Daniel W. Cranston
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory B 134: 218-238 (2019) - [j48]Daniel W. Cranston
A characterization of (4, 2)-choosable graphs. J. Graph Theory 92(4): 460-487 (2019) - [j47]Daniel W. Cranston
Acyclic Edge-Coloring of Planar Graphs: Δ Colors Suffice When Δ is Large. SIAM J. Discret. Math. 33(2): 614-628 (2019) - [j46]Daniel W. Cranston
The Hilton-Zhao Conjecture is True for Graphs with Maximum Degree 4. SIAM J. Discret. Math. 33(3): 1228-1241 (2019) - [i6]Daniel W. Cranston, Matthew P. Yancey:
Sparse graphs are near-bipartite. CoRR abs/1903.12570 (2019) - [i5]Anthony Bonato, Daniel W. Cranston, Melissa A. Huggan, Trent G. Marbach, Raja Mutharasan:
The Iterated Local Directed Transitivity Model for Social Networks. CoRR abs/1912.08924 (2019) - 2018
- [j45]Daniel W. Cranston
Edge Lower Bounds for List Critical Graphs, Via Discharging. Comb. 38(5): 1045-1065 (2018) - [j44]Daniel W. Cranston:
Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5. Electron. J. Comb. 25(3): 3 (2018) - [j43]Daniel W. Cranston
Planar graphs are 9/2-colorable. J. Comb. Theory B 133: 32-45 (2018) - 2017
- [j42]Daniel W. Cranston
The fractional chromatic number of the plane. Comb. 37(5): 837-861 (2017) - [j41]Daniel W. Cranston, Landon Rabern:
Beyond Degree Choosability. Electron. J. Comb. 24(3): 3 (2017) - [j40]Daniel W. Cranston
An introduction to the discharging method via graph coloring. Discret. Math. 340(4): 766-793 (2017) - [j39]Daniel W. Cranston
Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. 34(1): 114-132 (2017) - [j38]Daniel W. Cranston
List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles. J. Graph Theory 85(4): 721-737 (2017) - [j37]Daniel W. Cranston
Subcubic Edge-Chromatic Critical Graphs Have Many Edges. J. Graph Theory 86(1): 122-136 (2017) - [j36]Daniel W. Cranston
List-Coloring Claw-Free Graphs with Δ-1 Colors. SIAM J. Discret. Math. 31(2): 726-748 (2017) - [j35]Daniel W. Cranston
Short Fans and the 5/6 Bound for Line Graphs. SIAM J. Discret. Math. 31(3): 2039-2063 (2017) - 2016
- [j34]Daniel W. Cranston, Landon Rabern:
Painting Squares in $\Delta^2-1$ Shades. Electron. J. Comb. 23(2): 2 (2016) - [j33]Daniel W. Cranston, Landon Rabern:
Planar Graphs have Independence Ratio at least 3/13. Electron. J. Comb. 23(3): 3 (2016) - 2015
- [j32]Daniel W. Cranston, Landon Rabern:
A Note on Coloring Vertex-transitive Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j31]Daniel W. Cranston
Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker. Eur. J. Comb. 44: 23-42 (2015) - [j30]Daniel W. Cranston
Regular Graphs of Odd Degree Are Antimagic. J. Graph Theory 80(1): 28-33 (2015) - [j29]Daniel W. Cranston
Brooks' Theorem and Beyond. J. Graph Theory 80(3): 199-225 (2015) - [j28]Daniel W. Cranston
Graphs with χ=Δ Have Big Cliques. SIAM J. Discret. Math. 29(4): 1792-1814 (2015) - 2014
- [j27]Daniel W. Cranston, Rok Erman, Riste Skrekovski:
Choosability of the square of a planar graph with maximum degree four. Australas. J Comb. 59: 86-97 (2014) - [j26]Daniel W. Cranston
Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5. Discret. Appl. Math. 162: 167-176 (2014) - [j25]Daniel W. Cranston
The 1, 2, 3-Conjecture and 1, 2-Conjecture for sparse graphs. Discuss. Math. Graph Theory 34(4): 769-799 (2014) - 2013
- [j24]Daniel W. Cranston
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: 144-151 (2013) - [j23]Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley:
New Results in t-Tone Coloring of Graphs. Electron. J. Comb. 20(2): 17 (2013) - [j22]Daniel W. Cranston
Game matching number of graphs. Discret. Appl. Math. 161(13-14): 1828-1836 (2013) - [j21]Daniel W. Cranston
Hamiltonicity in connected regular graphs. Inf. Process. Lett. 113(22-24): 858-860 (2013) - [j20]Daniel W. Cranston
Coloring Claw-Free Graphs with Delta-1 Colors. SIAM J. Discret. Math. 27(1): 534-549 (2013) - 2012
- [j19]Daniel W. Cranston
Overlap number of graphs. J. Graph Theory 70(1): 10-28 (2012) - [j18]Daniel W. Cranston
List Colorings of K5-Minor-Free Graphs With Special List Assignments. J. Graph Theory 71(1): 18-30 (2012) - [j17]Jane Butterfield, Daniel W. Cranston
Revolutionaries and spies: Spy-good and spy-bad graphs. Theor. Comput. Sci. 463: 35-53 (2012) - [i4]Jane Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, Reza Zamani:
Revolutionaries and spies: Spy-good and spy-bad graphs. CoRR abs/1202.2910 (2012) - 2011
- [j16]Daniel W. Cranston
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011) - [j15]Daniel W. Cranston
Linear choosability of sparse graphs. Discret. Math. 311(17): 1910-1917 (2011) - [i3]Daniel W. Cranston, Clifford D. Smyth, Douglas B. West:
Revolutionaries and spies on trees and unicyclic graphs. CoRR abs/1110.2274 (2011) - 2010
- [j14]Daniel W. Cranston
Injective colorings of sparse graphs. Discret. Math. 310(21): 2965-2973 (2010) - [i2]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective colorings of graphs with low average degree. CoRR abs/1006.3776 (2010) - [i1]Daniel W. Cranston, Gexin Yu:
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. CoRR abs/1006.3779 (2010)
2000 – 2009
- 2009
- [j13]Michael O. Albertson, Daniel W. Cranston, Jacob Fox:
Crossings, Colorings, and Cliques. Electron. J. Comb. 16(1) (2009) - [j12]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) - [j11]Daniel W. Cranston:
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory 29(1): 163-178 (2009) - [j10]Daniel W. Cranston
Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. Graphs Comb. 25(1): 35-40 (2009) - [j9]Daniel W. Cranston
Regular bipartite graphs are antimagic. J. Graph Theory 60(3): 173-182 (2009) - [j8]Yuehua Bu, Daniel W. Cranston
Star coloring of sparse graphs. J. Graph Theory 62(3): 201-219 (2009) - [j7]Daniel W. Cranston
Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. SIAM J. Discret. Math. 23(2): 872-881 (2009) - 2008
- [j6]Daniel W. Cranston
Nomadic decompositions of bidirected complete graphs. Discret. Math. 308(17): 3982-3985 (2008) - [j5]Wenjie He, Lingmin Zhang, Daniel W. Cranston
Choice number of complete multipartite graphs K3*3, 2*(k-5), 1*2 and K4, 3*2, 2*(k-6), 1*3. Discret. Math. 308(23): 5871-5877 (2008) - [j4]Daniel W. Cranston
List-coloring the square of a subcubic graph. J. Graph Theory 57(1): 65-87 (2008) - [j3]David P. Bunde, Erin W. Chambers
Pebbling and optimal pebbling in graphs. J. Graph Theory 57(3): 215-238 (2008) - 2007
- [b1]Daniel W. Cranston:
Coloring and Labeling Problems on Graphs. University of Illinois Urbana-Champaign, USA, 2007 - [j2]Daniel W. Cranston
Short proofs for cut-and-paste sorting of permutations. Discret. Math. 307(22): 2866-2870 (2007) - 2006
- [j1]Daniel W. Cranston
Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. 306(21): 2772-2778 (2006) - 2005
- [c1]Charles Mullins, Daniel W. Cranston:
Research at ASMSA Based on the DIMACS BioMath Program. BioMath in the Schools 2005: 221-226
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: