2 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 2 cited
A Solution to the Edge-Balanced Index Set Problem for Complete Odd Bipartite Graphs
E. Krop, S. Minion, P. Patel +1
In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets (EBI) of complete bipartite graphs K_{m,n} by solving the cases where n = 1, 2, 3, 4,…
math.CO2008★ 2 cited
Almost-rainbow edge-colorings of some small subgraphs
Elliot Krop, Irina Krop
Let be the minimum number of colors necessary to color the edges of so that every is at least -colored. We improve current bounds on the {7/4}n-3$, slight…