Papers

You can find reviews of many of these papers on MathSciNet (subscription required).

• 24. Revolutionaries and Spies: Spy-good and Spy-bad graphs.  Jane V. Butterfield, Daniel W. Cranston, Gregory J. Puleo, Douglas B. West, and Reza Zamani.  Submitted. (28pp) pdf slides
• 23. Revolutionaries and Spies on Trees and Unicyclic Graphs.  Daniel W. Cranston, Clifford Smyth, and Douglas B. West.  Submitted. (9pp) pdf slides
• 22. New Results in t-tone Coloring of Graphs.  Daniel W. Cranston, Jaehoon Kim, and William B. Kinnersley.  Submitted. (13pp) pdf
• 21. Linear Choosability of Sparse Graphs.  Daniel W. Cranston and Gexin Yu.  Discrete Math. Vol. 311, no. 17, 6 September 2011, pp. 1910-1917. pdf slides
• 20. Chain-making Games in Grid-like Posets.  Daniel W. Cranston, Bill Kinnersley, Kevin Milans, Greg Puleo, and Douglas B. West.  Submitted. (14pp) pdf slides
• 19. List Colorings of K₅-minor-free Graphs with Special List Assignments.  Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt.  To appear in Journal of Graph Theory. (17pp) pdf slides
• 18. Overlap Number and Pure Overlap Number.  Daniel W. Cranston, Nitish Korula, Tim LeSaulnier, Kevin Milans, Chris Stocker, Jennifer Vandenbussche, and Douglas B. West.  To appear in Journal of Graph Theory. (21pp) pdf
• 17. Injective Colorings of Graphs with Low Average Degree.  Daniel W. Cranston, Seog-Jin Kim, and Gexin Yu.  Algorithmica. Vol. 60(3), July 2011, pp. 553-568. pdf
• 16. Colorings for Efficient Derivative Computation on Grids with Periodic Boundaries.  Daniel W. Cranston and Paul D. Hovland.   Submitted. (16pp)
• 15. Injective Colorings of Sparse Graphs.  Daniel W. Cranston, Seog-Jin Kim, and Gexin Yu.  Discrete Math. Vol. 310, no. 21, 6 November 2010, pp. 2965-2973. pdf slides
• 14. A Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid.  Daniel W. Cranston and Gexin Yu.  Electronic Journal of Combinatorics. Vol. 16, (2009) #R113. (15pp) pdf slides E-JC
• 13. Crossings, Colorings, and Cliques.  Michael O. Albertson, Daniel W. Cranston, and Jacob Fox.  Electronic Journal of Combinatorics. Vol. 16, (2009) #R45. (11pp) pdf slides E-JC
• 12. (7,2)-edge-choosability of 3-regular graphs.  Daniel W. Cranston and Douglas B. West.  SIAM Journal of Discrete Math. Vol. 23(2), April 2009, pp. 872-881. pdf
• 11. Star Coloring of Sparse Graphs.  Yuehua Bu, Daniel W. Cranston, Mickael Montassier, Andre Raspaud, and Weifan Wang.  Journal of Graph Theory. Vol. 62(3), November 2009, pp. 201-219. pdf slides
• 10. Mulitgraphs with Δ ≥ 3 are Totally-(2Δ-1)-Choosable.  Daniel W. Cranston.  Graphs and Combinatorics. Vol. 25(1), May 2009, pp. 35-40. pdf
• 9. Edge-choosability and Total-choosability of Planar Graphs with no Adjacent 3-cycles.   Daniel W. Cranston.  Discussiones Mathematicae Graph Theory. Vol. 29 (1), pp. 163-178. pdf slides
• 8. Research at ASMSA Based on the DIMACS Biomath Program.  Charles Mullins and Daniel W. Cranston.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science. (6pp) pdf
• 7. Regular Bipartite Graphs are Antimagic.  Daniel W. Cranston.  Journal of Graph Theory. Vol. 60, March 2009, pp. 173-182. pdf slides
• 6. Choice number of complete multipartite graphs K_{3*3,2*(k-5),1*2} and K_{4,3*2,2*(k-6),1*3}.  Wenjie He, Lingmin Zhang, Daniel W. Cranston, Yufa Shen, and Guoping Zheng.  Discrete Math. Vol 308, no. 23, 6 December 2008, pp. 5871-5877. pdf
• 5. Nomadic Decompositions of Bidirected Complete Graphs.  Daniel W. Cranston.  Discrete Math. Vol. 308, no. 17, 6 September 2008, pp. 3982-3985. pdf
• 4. Pebbling and Optimal Pebbling in Graphs.  David Bunde, Erin Chambers, Daniel W. Cranston, Kevin Milans, and Douglas West.  Journal of Graph Theory. Vol. 57, March 2008, pp. 215-238. pdf
• 3. List-coloring the Square of a Subcubic Graph.  Daniel W. Cranston and Seog-Jin Kim.   Journal of Graph Theory. Vol. 57, January 2008, pp. 65-87. pdf slides more slides
• 2. Bounds for Cut-and-Paste Sorting of Permutations.  Daniel W. Cranston, Hal Sudborough, and Douglas West.  Discrete Math. Vol. 307, no. 22, 28 October 2007, pp. 2866-2870. pdf slides
• 1. Strong Edge-Coloring of Graphs with Maximum Degree 4 using 22 Colors.   Daniel W. Cranston.  Discrete Math. Vol. 306, no. 21, 6 November 2006, pp. 2772-2778. pdf
• 0. Coloring and Labeling Problems in Graphs.  Daniel W. Cranston.  Doctoral Thesis, May 2007. pdf
  
  Back to my homepage.