Grant Cairns, Stacey Mendan
Published 2013-03-08Version 1
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 to be graphic, that is, the degree sequence of a finite graph.
On the approximate shape of degree sequences that are not potentially $H$-graphic
Towards random uniform sampling of bipartite graphs with given degree sequence
Graphs with degree sequence $\{m^{m-1},n^{n-1}\}$ and $\{m^n,n^m\}$
![QR code for arXiv:1303.2144 [math.CO]](http://oss.arxitics.com/images/favicon.svg)