22 citations · 92 across the 73 of their papers we have counts for
4 papers · 1 filter
Revolutionaries and spies on trees and unicyclic graphs
Daniel W. Cranston, Clifford D. Smyth, Douglas B. West
A team of {\it revolutionaries} and a team of {\it spies} play a game on a graph . Initially, revolutionaries and then spies take positions at vertices. In each subseque…
New results in -tone coloring of graphs
Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley
A -tone -coloring of assigns to each vertex of a set of colors from so that vertices at distance share fewer than common colors. The {\it $…
Chain-making games in grid-like posets
Daniel W. Cranston, William B. Kinnersley, Kevin G. Milans +2
We study the Maker-Breaker game on the hypergraph of chains of fixed size in a poset. In a product of chains, the maximum size of a chain that Maker can guarantee building is $k-\l…
List colorings of -minor-free graphs with special list assignments
Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza +1
A {\it list assignment} of a graph is a function that assigns a set (list) of colors to every vertex of . Graph is called {\it -list colorable} if it a…