A merging procedure for labelings of bipartite graphs

Paola Bonacini, Lucia Marino

Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f:V\to [0,2m]$ which, amon…