Jian Hua Yin,
Jia-Yun Li,
Jin-Zhi Du,
Hai-Yan Li
(2019)
Let be the complete bipartite graph with partite sets and . A split bipartite-graph on vertices, denoted by , is the graph obtained from by adding new vertices , such that each of is adjacent to each of and each of is adjacent to each of . Let and be nonincreasing lists of nonnegative integers, having lengths and , respectively. The pair is potentially -bigraphic if there is a simple bipartite graph containing (with vertices in the part of size ...