Patrick Bennett

activity

20122017

most citedAdding random edges to create the square of a Hamilton cycle

12 citations · 12 across the 2 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012

The t-tone chromatic number of random graphs

Deepak Bal, Patrick Bennett, Andrzej Dudek +1

A proper 2-tone $k$ -coloring of a graph is a labeling of the vertices with elements from $(2 [ k ])$ such that adjacent vertices receive disjoint labels and vertices distance…

math.CO2012

A greedy algorithm for finding a large 2-matching on a random cubic graph

Deepak Bal, Patrick Bennett, Tom Bohman +1

A 2-matching of a graph $G$ is a spanning subgraph with maximum degree two. The size of a 2-matching $U$ is the number of edges in $U$ and this is at least $n-\k(U)$ where $n$ is t…