7 citations · 13 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 1 cited
Forced Edges and Graph Structure
Brian Cloteaux
For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine…
math.CO2016★ 2 cited
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
Brian Cloteaux
We give a sufficient condition for a degree sequence to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zve…