D. Cranston

activity

20052026

most citedA Note on Odd Colorings of 1-Planar Graphs

22 citations · 92 across the 73 of their papers we have counts for

collaborators

Showing 2012 · math.COShow all

3 papers · 2 filters

math.CO2012★ 1 cited

Game matching number of graphs

Daniel W. Cranston, William B. Kinnersley, Suil O. +1

We study a competitive optimization version of $α^{'} (G)$ , the maximum size of a matching in a graph $G$ . Players alternate adding edges of $G$ to a matching until it becomes a maxima…

math.CO2012

Coloring claw-free graphs with Δ-1 colors

Daniel W. Cranston, Landon Rabern

We prove that every claw-free graph $G$ that doesn't contain a clique on $Δ (G) \geq 9$ vertices can be $Δ (G) - 1$ colored.

math.CO2012

Hamiltonicity in connected regular graphs

Daniel W. Cranston, Suil O

In 1980, Jackson proved that every 2-connected $k$ -regular graph with at most $3 k$ vertices is Hamiltonian. This result has been extended in several papers. In this note, we determ…