| 2009 |
|---|
| 7 | EE | Daniel W. Cranston:
Regular bipartite graphs are antimagic.
Journal of Graph Theory 60(3): 173-182 (2009) |
| 2008 |
|---|
| 6 | EE | Daniel W. Cranston:
Nomadic decompositions of bidirected complete graphs.
Discrete Mathematics 308(17): 3982-3985 (2008) |
| 5 | EE | Wenjie He,
Lingmin Zhang,
Daniel W. Cranston,
Yufa Shen,
Guoping Zheng:
Choice number of complete multipartite graphs K3*3, 2*(k-5), 1*2 and K4, 3*2, 2*(k-6), 1*3.
Discrete Mathematics 308(23): 5871-5877 (2008) |
| 4 | EE | Daniel W. Cranston,
Seog-Jin Kim:
List-coloring the square of a subcubic graph.
Journal of Graph Theory 57(1): 65-87 (2008) |
| 3 | EE | David P. Bunde,
Erin W. Chambers,
Daniel W. Cranston,
Kevin Milans,
Douglas B. West:
Pebbling and optimal pebbling in graphs.
Journal of Graph Theory 57(3): 215-238 (2008) |
| 2007 |
|---|
| 2 | EE | Daniel W. Cranston,
Ivan Hal Sudborough,
Douglas B. West:
Short proofs for cut-and-paste sorting of permutations.
Discrete Mathematics 307(22): 2866-2870 (2007) |
| 2006 |
|---|
| 1 | EE | Daniel W. Cranston:
Strong edge-coloring of graphs with maximum degree 4 using 22 colors.
Discrete Mathematics 306(21): 2772-2778 (2006) |
