A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC

@article{Cairns2016ASC,
  title={A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC},
  author={G. Cairns and Stacey Mendan and Y. Nikolayevsky},
  journal={Bulletin of the Australian Mathematical Society},
  year={2016},
  volume={94},
  pages={195 - 200}
}
  • G. Cairns, Stacey Mendan, Y. Nikolayevsky
  • Published 2016
  • Mathematics
  • Bulletin of the Australian Mathematical Society
  • 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. 
    2 Citations

    References

    SHOWING 1-10 OF 12 REFERENCES
    Contributions to the theory of graphic sequences
    • 37
    • PDF
    Symmetric Bipartite Graphs and Graphs with Loops
    • 6
    • PDF
    A note on regular Ramsey graphs
    • 13
    • PDF
    A theorem on flows in networks
    • 510
    • PDF
    A sharp refinement of a result of Zverovich-Zverovich
    • 7
    • PDF
    An improvement of a result of Zverovich - Zverovich
    • 6
    • PDF
    Reduced criteria for degree sequences
    • J. Miller
    • Computer Science, Mathematics
    • Discret. Math.
    • 2013
    • 12
    • PDF
    Combinatorial Properties of Matrices of Zeros and Ones
    • 569
    • PDF