Cranston, Dan - Department of Mathematics and Applied Mathematics, Virginia Commonwealth University

Advanced Search

Cranston, Dan - Department of Mathematics and Applied Mathematics, Virginia Commonwealth University

Pebbling and Optimal Pebbling in Graphs David P. Bunde
Chain-making games in grid-like posets Daniel W. Cranston
Antimagic Labelings of Regular Bipartite Graphs Daniel Cranston
Linear Choosability of Sparse Graphs Daniel W. Cranston
INJECTIVE COLORINGS OF GRAPHS WITH LOW AVERAGE DEGREE DANIEL W. CRANSTON
Injective colorings of sparse graphs Daniel W. Cranston
Star coloring of sparse graphs Daniel W. Cranston
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Choice number of complete multipartite graphs K33,2(k-5),12 and K4,32,2(k-6),13
List-coloring the Square of a Subcubic Graph Daniel W. Cranston
Bounds for Cut-and-Paste Sorting of Permutations Daniel Cranston
DIMACS Technical Report 2008-03 February 2008
Crossings, colorings, and cliques Michael O. Albertson
Nomadic Decompositions of Bidirected Complete Graphs Daniel W. Cranston
COLORINGS FOR MORE EFFICIENT COMPUTATION OF JACOBIAN MATRICES DANIEL WESLEY CRANSTON
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Overlap Number of Graphs Daniel W. Cranston
Multigraphs with 3 are Totally-(2-1)-Choosable Daniel W. Cranston
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
c Copyright by Daniel Wesley Cranston, 2007 COLORING AND LABELING PROBLEMS ON GRAPHS
List colorings of K5-minor-free graphs with special list assignments
Regular bipartite graphs are antimagic Daniel W. Cranston
Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors
New results in t-tone coloring of graphs Daniel W. Cranston
Revolutionaries and spies on trees and unicyclic graphs Daniel W. Cranston
Revolutionaries and spies: Spy-good and spy-bad graphs Jane V. Butterfield