Some criteria for integer sequences pair being realizable by a graph

Jiyun Guo, Miao Fu, Jun Wang

Let $A=(a_1,\dots ,a_n)$ and $B=(b_1,\dots ,b_n)$ be two sequences of nonnegative integers with $a_i\le b_i$ for $1\le i\le n$. The pair $(A;B)$ is said to be realizable by a grap…