N. Kahl

most citedA Survey of Best Monotone Degree Conditions for Graph Properties

1 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2014

A note on the values of independence polynomials at $- 1$

Jonathan Cutler, Nathan Kahl

The independence polynomial $I (G; x)$ of a graph $G$ is $I (G; x) = \sum_{k = 1}^{α (G)} s_{k} x^{k}$ , where $s_{k}$ is the number of independent sets in $G$ of size $k$ . The decycling number of…

math.CO2014★ 1 cited

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…

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 note on the values of independence polynomials at −1

A Survey of Best Monotone Degree Conditions for Graph Properties

Toughness and Vertex Degrees

Degree Sequences and the Existence of k-Factors

A note on the values of independence polynomials at $- 1$

Degree Sequences and the Existence of $k$ -Factors