Daniel W. Cranston

	2012
21		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)
20		Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher Stocker, Jennifer Vandenbussche, Douglas B. West: Overlap number of graphs. Journal of Graph Theory 70(1): 10-28 (2012)
	2011
19		Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011)
18		Daniel W. Cranston, Clifford D. Smyth, Douglas B. West: Revolutionaries and spies on trees and unicyclic graphs CoRR abs/1110.2274: (2011)
17		Daniel W. Cranston, Gexin Yu: Linear choosability of sparse graphs. Discrete Mathematics 311(17): 1910-1917 (2011)
	2010
16		Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of graphs with low average degree CoRR abs/1006.3776: (2010)
15		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)
14		Daniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of sparse graphs. Discrete Mathematics 310(21): 2965-2973 (2010)
	2009
13		Daniel W. Cranston: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discussiones Mathematicae Graph Theory 29(1): 163-178 (2009)
12		Daniel W. Cranston, Gexin Yu: A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electr. J. Comb. 16(1): (2009)
11		Michael O. Albertson, Daniel W. Cranston, Jacob Fox: Crossings, Colorings, and Cliques. Electr. J. Comb. 16(1): (2009)
10		Daniel W. Cranston: Multigraphs with Delta >= 3 are Totally-(2Delta-1)-Choosable. Graphs and Combinatorics 25(1): 35-40 (2009)
9		Daniel W. Cranston: Regular bipartite graphs are antimagic. Journal of Graph Theory 60(3): 173-182 (2009)
8		Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang: Star coloring of sparse graphs. Journal of Graph Theory 62(3): 201-219 (2009)
7		Daniel W. Cranston, Douglas B. West: Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. SIAM J. Discrete Math. 23(2): 872-881 (2009)
	2008
6		Daniel W. Cranston: Nomadic decompositions of bidirected complete graphs. Discrete Mathematics 308(17): 3982-3985 (2008)
5		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		Daniel W. Cranston, Seog-Jin Kim: List-coloring the square of a subcubic graph. Journal of Graph Theory 57(1): 65-87 (2008)
3		David P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin G. Milans, Douglas B. West: Pebbling and optimal pebbling in graphs. Journal of Graph Theory 57(3): 215-238 (2008)
	2007
2		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		Daniel W. Cranston: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Mathematics 306(21): 2772-2778 (2006)

Coauthor Index

1	Michael O. Albertson	[11]
2	Yuehua Bu	[8]
3	David P. Bunde	[3]
4	Jane Butterfield	[21]
5	Erin W. Chambers	[3]
6	Jacob Fox	[11]
7	Wenjie He	[5]
8	Seog-Jin Kim	[4] [14] [16] [19]
9	Nitish Korula	[20]
10	Timothy D. LeSaulnier	[20]
11	Kevin G. Milans	[3] [20]
12	Mickaël Montassier	[8]
13	Gregory J. Puleo	[21]
14	André Raspaud	[8]
15	Yufa Shen	[5]
16	Clifford D. Smyth	[18]
17	Christopher Stocker	[20]
18	Ivan Hal Sudborough	[2]
19	Jennifer Vandenbussche	[20]
20	Wei-Fan Wang (Weifan Wang)	[8]
21	Douglas B. West	[2] [3] [7] [18] [20] [21]
22	Gexin Yu	[12] [14] [15] [16] [17] [19]
23	Reza Zamani	[21]
24	Lingmin Zhang	[5]
25	Guoping Zheng	[5]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page