Daniel W. Cranston

Statistics

Publications

Citations

704

H-Index

Active since

2006

Affiliations

Virginia Commonwealth University(Current)

William & Mary

Rutgers, The State University of New Jersey

University of Illinois Urbana-Champaign

Center for Discrete Mathematics and Theoretical Computer Science

Daniel W. Cranston is an author at Virginia Commonwealth University specializing in discrete mathematics, graph theory, and combinatorial optimization.

ORCID

Top concepts

Graph TheoryDiscrete MathematicsCombinatorial OptimizationEngineeringEducationNetwork ScienceNetwork AnalysisBusinessComputer ScienceTheory Of Computing

Publications per year

2006–2024

Publications

An introduction to the discharging method via graph coloring

Daniel W. Cranston, Douglas B. West · Discrete Mathematics · 2016 · 65 citations

Mathematical Programming, Engineering, Graph Theory +7

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

Daniel W. Cranston · Discrete Mathematics · 2006 · 64 citations

Maximum Degree 4, Graph Theory, Algebraic Graph Theory +6

Regular Graphs of Odd Degree Are Antimagic

Daniel W. Cranston, Yu‐Chang Liang, Xuding Zhu · Journal of Graph Theory · 2014 · 59 citations

Graph Minor, Geometric Graph Theory, Graph Theory +8

Regular bipartite graphs are antimagic

Daniel W. Cranston · Journal of Graph Theory · 2008 · 58 citations

Graph Theory, Algebraic Graph Theory, Structural Graph Theory +7

Injective colorings of sparse graphs

Daniel W. Cranston, Seog‐Jin Kim, Gexin Yu · Discrete Mathematics · 2010 · 40 citations

Graph Sparsity, Graph Theory, Topological Graph Theory +4

1–5 of 27