arXiv Analytics

Sign in

arXiv:1607.03836 [math.CO]AbstractReferencesReviewsResources

A Sufficient Condition for Graphic Lists with Given Largest and Smallest Entries, Length, and Sum

Brian Cloteaux

Published 2016-07-13Version 1

We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.

Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1512.02404 [math.CO] (Published 2015-12-08)
A sufficient condition for a pair of sequences to be bipartite graphic
arXiv:1506.07949 [math.CO] (Published 2015-06-26)
A sufficient condition for a balanced bipartite digraph to be hamiltonian
arXiv:1012.1231 [math.CO] (Published 2010-12-06, updated 2011-02-22)
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph

Links

Toolbox