2 citations · 3 across the 2 of their papers we have counts for
4 papers
How Much Regularity Forces a Sequence to be Graphic?
Brian Cloteaux
For an integer sequence (with even sum), the closer that the sequence is to being regular, the more likely that the sequence is graphic. But how regular must a sequence be before i…
One-Pass Graphic Approximation of Integer Sequences
Brian Cloteaux
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give…
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…
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…