E. Schmeichel

activity

20022021

most citedOrienting Graphs to Optimize Reachability

30 citations · 31 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021

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…

math.CO2009★ 1 cited

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 $G$ to guarantee $G$ is $t$ -tough. We first give a best monotone theorem when $t \geq 1$ , but then show…

math.CO2009

Degree Sequences and the Existence of $k$ -Factors

D. Bauer, H. J. Broersma, J. van den Heuvel +2

We consider sufficient conditions for a degree sequence $π$ to be forcibly $k$ -factor graphical. We note that previous work on degrees and factors has focused primarily on finding…

A generalization of a theorem of Nash-Williams

Toughness and Vertex Degrees

Degree Sequences and the Existence of k-Factors

Degree Sequences and the Existence of $k$ -Factors