D. Cranston

发表

An introduction to the discharging method via graph coloring

Daniel W. Cranston, Douglas B. West, D. West, 2013, Discret. Math..

Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)

D. Cranston, 2022, The Electronic Journal of Combinatorics.

5‐Coloring reconfiguration of planar graphs with no short odd cycles

Daniel W. Cranston, Reem Mahmoud, D. Cranston, 2022, Journal of Graph Theory.

Coloring $(P_5, \text{gem})$-free graphs with $\Delta -1$ colors

Daniel W. Cranston, Hudson Lafayette, Landon Rabern, 2020, 2006.02015.

Graphs with χ=Δ Have Big Cliques

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2015, SIAM J. Discret. Math..

Painting Squares in $\Delta^2-1$ Shades

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2013, Electron. J. Comb..

Hamiltonicity in connected regular graphs

Daniel W. Cranston, O Suil, O. Suil, 2012, Inf. Process. Lett..

Injective colorings of sparse graphs

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu, 2010, Discret. Math..

Regular bipartite graphs are antimagic

Daniel W. Cranston, D. Cranston, 2009, J. Graph Theory.

List‐coloring the square of a subcubic graph

Daniel W. Cranston, Seog-Jin Kim, Seog-Jin Kim, 2008, J. Graph Theory.

Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem

D. Cranston, 2007, 0708.2776.

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Daniel W. Cranston, D. Cranston, 2006, Discrete Mathematics.

Painting Squares in 2 1 Shades

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014 .

C O ] 1 6 M ay 2 01 3 Graphs with χ = ∆ have big cliques

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2013 .

A note on odd colorings of 1-planar graphs

Zi-Xia Song, Michael Lafferty, D. Cranston, 2022, Discret. Appl. Math..

Coloring a graph with Δ-1 colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2012, Eur. J. Comb..

The Iterated Local Directed Transitivity Model for Social Networks

Daniel W. Cranston, A. Bonato, T. Marbach, 2019, WAW.

A Guide to the Discharging Method

D. West, D. Cranston, 2013 .

Crossings, Colorings, and Cliques

Daniel W. Cranston, Jacob Fox, Michael O. Albertson, 2009, Electron. J. Comb..

In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent

Daniel W. Cranston, Reem Mahmoud, Reem Mahmoud, 2021, European journal of combinatorics (Print).

Proper Conflict-free Coloring of Graphs with Large Maximum Degree

Chunqi Liu, D. Cranston, 2022, 2211.02818.

Odd Colorings of Sparse Graphs

Daniel W. Cranston, D. Cranston, 2022, 2201.01455.

Strong edge-coloring of cubic bipartite graphs: A counterexample

Daniel W. Cranston, D. Cranston, 2021, Discret. Appl. Math..

Regular Graphs of Odd Degree Are Antimagic

Daniel W. Cranston, Xuding Zhu, Yu-Chang Liang, 2013, Journal of Graph Theory.

Kempe classes and almost bipartite graphs

Carl Feghali, D. Cranston, 2023, Discret. Appl. Math..

Circular Flows in Planar Graphs

Daniel W. Cranston, Jiaao Li, Jiaao Li, 2018, SIAM J. Discret. Math..

C O ] 2 4 D ec 2 01 8 Circular Flows in Planar Graphs

Daniel W. Cranston, Jiaao Li, D. Cranston, 2018 .

Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2015, J. Graph Theory.

Optimally Reconfiguring List and Correspondence Colourings

W. C. V. Batenburg, Stijn Cambie, D. Cranston, 2022, Eur. J. Comb..

Planar Turán Numbers of Cycles: A Counterexample

Bernard Lidick'y, Xiaonan Liu, Abhinav Shantanam, 2021, Electron. J. Comb..

A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid

Daniel W. Cranston, Gexin Yu, Gexin Yu, 2009, Electron. J. Comb..

Brooks' Theorem and Beyond

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, J. Graph Theory.

Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable

D. West, D. Cranston, 2008, SIAM J. Discret. Math..

Classes of 3-regular graphs that are ( 7 , 2 )-edge-choosable

Dean Kelley, D. Cranston, Douglas B. West, 2008 .

A characterization of (4,2) ‐choosable graphs

D. Cranston, 2017, J. Graph Theory.

Coloring and Labeling Problems on Graphs

Daniel W. Cranston, D. Cranston, 2007 .

Planar graphs are 9/2-colorable

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, J. Comb. Theory B.

A note on bootstrap percolation thresholds in plane tilings using regular polygons

Daniel W. Cranston, N. Bushaw, D. Cranston, 2018, The Australasian Journal of Combinatorics.

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, C. Kent, 2013, Applied Mathematics and Computation.

Vertex Partitions into an Independent Set and a Forest with Each Component Small

Daniel W. Cranston, Matthew P. Yancey, D. Cranston, 2020, SIAM Journal on Discrete Mathematics.

Sparse graphs are near-bipartite

Daniel W. Cranston, Matthew P. Yancey, D. Cranston, 2019, SIAM J. Discret. Math..

Graphs with $\chi=\Delta$ have big cliques

Daniel W. Cranston, Landon Rabern, D. Cranston, 2013, 1305.3526.

A Note on Coloring Vertex-transitive Graphs

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2014, Electron. J. Comb..

Conjectures equivalent to the Borodin-Kostochka Conjecture that are a priori weaker

Landon Rabern, D. Cranston, 2012 .

Coloring claw-free graphs with − 1 colors

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2012 .

Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)

Daniel W. Cranston, D. Cranston, 2022, Electronic Journal of Combinatorics.

Bounding clique size in squares of planar graphs

D. Cranston, 2023, Eur. J. Comb..

Cliques in squares of graphs with maximum average degree less than 4

Gexin Yu, D. Cranston, 2023, Journal of Graph Theory.

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles

Ilkyoo Choi, Théo Pierron, D. Cranston, 2018, Comb..

Planar graphs of girth at least five are square (Δ + 2)-choosable

Luke Postle, Marthe Bonamy, Daniel W. Cranston, 2015, J. Comb. Theory B.

List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles

Daniel W. Cranston, Bobby Jaeger, D. Cranston, 2015, J. Graph Theory.

Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5

Daniel W. Cranston, Riste Skrekovski, R. Škrekovski, 2013, Discret. Appl. Math..

Choosability of the square of a planar graph with maximum degree four

Daniel W. Cranston, Riste Skrekovski, Rok Erman, 2013, Australas. J Comb..

Sufficient sparseness conditions for G 2 to be ( ∆ + 1 )-choosable

Daniel W. Cranston, Riste Škrekovski, R. Škrekovski, 2013 .

Acyclic edge-coloring of planar graphs: $\Delta$ colors suffice when $\Delta$ is large

Daniel W. Cranston, D. Cranston, 2017 .

Research at ASMSA Based on the DIMACS BioMath Program

Daniel W. Cranston, Charles Mullins, C. Mullins, 2005, BioMath in the Schools.

Coloring (P5,gem) $({P}_{5},\text{gem})$ ‐free graphs with Δ −1 ${\rm{\Delta }}-1$ colors

Daniel W. Cranston, Hudson Lafayette, Landon Rabern, 2022, Journal of Graph Theory.

Special issue in honour of Landon Rabern

B. Rabern, D. Cranston, H. Kierstead, 2023, Discret. Math..

Coloring (P5,gem) $({P}_{5},\text{gem})$ ‐free graphs with Δ −1 ${\rm{\Delta }}-1$ colors

Daniel W. Cranston, Hudson Lafayette, Landon Rabern, 2022, J. Graph Theory.

Colorings for Efficient Derivative Computation on Grids with Periodic Boundaries ∗

Daniel W. Cranston, P. Hovland, D. Cranston, 2008 .

Ohba's Conjecture is True for Graphs with Independence Number 3

D. Cranston, 2007 .

The fractional chromatic number of the plane

Daniel W. Cranston, Landon Rabern, Landon Rabern, 2015, Combinatorica.