1. Lecture Notes in Computer Science;A Bar-Noy,2021
2. Bar-Noy, A., Böhnlein, T., Peleg, D., Rawitz, D.: On realizing a single degree sequence by a bipartite graph. In: 18th SWAT, vol. 227 of LIPIcs, pp. 1:1–1:17 (2022)
3. Bar-Noy, A., Böhnlein, T., Peleg, D., Rawitz, D.: On the role of the high-low partition in realizing a degree sequence by a bipartite graph. In: 47th MFCS, vol. 241 of LIPIcs, pp. 14:1–14:15 (2022)
4. Burstein, D., Rubin, J.: Sufficient conditions for graphicality of bidegree sequences. SIAM J. Discret. Math. 31(1), 50–62 (2017)
5. Chungphaisan, V.: Conditions for sequences to be r-graphic. Discr. Math. 7(1–2), 31–39 (1974)