A sufficient condition for a pair of sequences to be bipartite graphic
Grant CairnsStacey MendanYuri Nikolayevsky
所有作者
Grant CairnsStacey MendanYuri Nikolayevsky
文献摘要
We present a sufficient condition for a pair of finite integer sequences to
be degree sequences of a bipartite graph, based only on the lengths of the
sequences and their largest and smallest elements.