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

DOI10.1017/S0004972716000198zbMath1361.05030arXiv1512.02404MaRDI QIDQ2986529

Stacey Mendan, Grant Cairns, Yuri Nikolayevsky

Publication date: 16 May 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.02404

zbMATH Keywords

bipartite graphdegree sequences

Mathematics Subject Classification ID

Vertex degrees (05C07)

Related Items (2)

An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences ⋮ ON PROBLEMS OF -CONNECTED GRAPHS FOR

Cites Work

• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• A theorem on flows in networks
• Contributions to the theory of graphic sequences
• Reduced criteria for degree sequences
• A sharp refinement of a result of Zverovich-Zverovich
• Combinatorial Properties of Matrices of Zeros and Ones

This page was built for publication: A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC