Nathan Kahl

According to our database, Nathan Kahl authored at least 17 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On maximum graphs in Tutte polynomial posets.

Nathan Kahl, Kristi Luttrell

Discret. Appl. Math., November, 2023

2022

Dr. Charles L. Suffel: Scholar, teacher, mentor, friend.

Daniel Gross, Nathan Kahl, Kristi Luttrell, John T. Saccoman

Networks, 2022

Extremal graphs for the Tutte polynomial.

Nathan Kahl

J. Comb. Theory, Ser. B, 2022

2021

Graph vulnerability parameters, compression, and threshold graphs.

Nathan Kahl

Discret. Appl. Math., 2021

2019

Graph vulnerability parameters, compression, and quasi-threshold graphs.

Nathan Kahl

Discret. Appl. Math., 2019

2016

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

Jonathan Cutler, Nathan Kahl

Discret. Math., 2016

On constructing rational spanning tree edge densities.

Nathan Kahl

Discret. Appl. Math., 2016

2015

Best Monotone Degree Conditions for Graph Properties: A Survey.

Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro

Graphs Comb., 2015

2014

Toughness and binding number.

Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro

Discret. Appl. Math., 2014

2013

Toughness and Vertex Degrees.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel

J. Graph Theory, 2013

2012

Degree Sequences and the Existence of k-Factors.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel

Graphs Comb., 2012

2011

Best monotone degree conditions for binding number.

Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel

Discret. Math., 2011

2010

Graphs with the maximum or minimum number of 1-factors.

Daniel Gross, Nathan Kahl, John T. Saccoman

Discret. Math., 2010

2009

Sufficient degree conditions for <i>k</i>-edge-connectedness of a graph.

Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel

Networks, 2009

2008

Long Cycles in 2-Connected Triangle-Free Graphs.

Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel

Ars Comb., 2008

2007

Generalizing D-graphs.

Arthur H. Busch, Michael Ferrara, Nathan Kahl

Discret. Appl. Math., 2007

Tutte sets in graphs II: The complexity of finding maximum Tutte sets.

Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec

Discret. Appl. Math., 2007