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 2006Show all

3 papers · 1 filter

math.CO2006

Nomadic Decompositions of Bidirected Complete Graphs

Daniel W. Cranston

We use $K_{n}^{*}$ to denote the bidirected complete graph on $n$ vertices. A nomadic Hamiltonian decomposition of $K_{n}^{*}$ is a Hamiltonian decomposition, with the additional property…

math.CO2006

Short Proofs for Cut-and-Paste Sorting of Permutations

Daniel Cranston, I. Hal Sudborough, Douglas B. West

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pa…

math.CO2006★ 2 cited

A Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors

Daniel Cranston

In 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is bounded above by $5/4 Δ^{2}$ when $Δ$ is even and $1/4 (5 Δ^{2} - 2Δ + 1)$ when $Δ$ is odd. They…