98 citations · 348 across the 30 of their papers we have counts for
4 papers · 1 filter
Propagation time for zero forcing on a graph
Leslie Hogben, My Huynh, Nicole Kingsley +3
Zero forcing (also called graph infection) on a simple, undirected graph is based on the color-change rule: If each vertex of is colored either white or black, and vertex $…
Crossing numbers of complete tripartite and balanced complete multipartite graphs
Ellen Gethner, Leslie Hogben, Bernard Lidický +3
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number…
Rainbow triangles in three-colored graphs
Jozsef Balogh, Ping Hu, Bernard Lidicky +3
Erdos and Sos proposed a problem of determining the maximum number F(n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F(n) = F(a)+ F(b…
Rainbow arithmetic progressions
Steve Butler, Craig Erickson, Leslie Hogben +8
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers and , the expression $aw([n…