4 citations · 7 across the 13 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012
The t-tone chromatic number of random graphs
Deepak Bal, Patrick Bennett, Andrzej Dudek +1
A proper 2-tone -coloring of a graph is a labeling of the vertices with elements from 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 is a spanning subgraph with maximum degree two. The size of a 2-matching is the number of edges in and this is at least $n-\k(U)$ where is t…