1 citations · 1 across the 1 of their papers we have counts for
1 paper
Anil Ada, Melanie Coggan, Paul Di Marco +8
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1; V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a tw…