1 citations · 2 across the 4 of their papers we have counts for
4 papers
A generalization of a theorem of Nash-Williams
D. Bauer, L. Lesniak, E. Schmeichel
In 1972, Chvatal gave a well-known sufficient condition for a graphical sequence to be forcibly hamiltonian, and showed that in some sense his condition is best possible. Nash-Will…
A Survey of Best Monotone Degree Conditions for Graph Properties
D. Bauer, H. J. Broersma, J. van den Heuvel +5
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is…
Toughness and Vertex Degrees
D. Bauer, H. J. Broersma, J. van den Heuvel +2
We study theorems giving sufficient conditions on the vertex degrees of a graph to guarantee is -tough. We first give a best monotone theorem when , but then show…
Degree Sequences and the Existence of -Factors
D. Bauer, H. J. Broersma, J. van den Heuvel +2
We consider sufficient conditions for a degree sequence to be forcibly -factor graphical. We note that previous work on degrees and factors has focused primarily on finding…