2 citations · 2 across the 3 of their papers we have counts for
5 papers
A sufficient condition for a pair of sequences to be bipartite graphic
Grant Cairns, Stacey Mendan, Yuri 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 a…
A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
Grant Cairns, Stacey Mendan, Yuri Nikolayevsky
We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree lis…
A sharp refinement of a result of Zverovich--Zverovich
Grant Cairns, Stacey Mendan, Yuri Nikolayevsky
For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequenc…
An improvement of a result of Zverovich--Zverovich
Grant Cairns, Stacey Mendan
We give an improvement of a result of Zverovich and Zverovich which gives a condition on the first and last elements in a decreasing sequence of positive integers for the sequence…
Some Remarks on Graphical Sequences for Graphs and Bipartite Graphs
Grant Cairns, Stacey Mendan
For finite sequence $\underbar{\em d}$ of positive integers, we consider graphs that have $\underbar{\em d}$ as their list of vertex degrees, and bipartite graphs for which each pa…