Author:
Cairns Grant,Mendan Stacey,Nikolayevsky Yuri
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps;Barrus;Discrete Math.,2012
2. An improvement of a result of Zverovich–Zverovich;Cairns;Ars Math. Contemp.,2016
3. Symmetric bipartite graphs and graphs with loops;Cairns;Discrete Math. Theor. Comput. Sci.,2015
4. A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences;Cairns;Australas. J. Combin.,2014
5. A short constructive proof of the Erdős-Gallai characterization of graphic lists;Tripathi;Discrete Math.,2010
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献