A sharp refinement of a result of Zverovich-Zverovich

DOI10.1016/j.disc.2015.02.001zbMath1309.05049arXiv1310.3992OpenAlexW2007756468MaRDI QIDQ2339424

Stacey Mendan, Yuri Nikolayevsky, Grant Cairns

Publication date: 1 April 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graphic sequencevertex degree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Related Items (5)

Planar bipartite biregular degree sequences ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ A SUFFICIENT CONDITION FOR A PAIR OF SEQUENCES TO BE BIPARTITE GRAPHIC ⋮ An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences ⋮ Unnamed Item

Cites Work

• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• Contributions to the theory of graphic sequences
• A note on a theorem of Erdős and Gallai
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• An improvement of a result of Zverovich–Zverovich
• A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences
• Symmetric Bipartite Graphs and Graphs with Loops

This page was built for publication: A sharp refinement of a result of Zverovich-Zverovich