Nathan Kahl

Orcid: 0009-0004-0121-4884

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On maximum graphs in Tutte polynomial posets.
Discret. Appl. Math., November, 2023

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

Extremal graphs for the Tutte polynomial.
J. Comb. Theory B, 2022

2021
Graph vulnerability parameters, compression, and threshold graphs.
Discret. Appl. Math., 2021

2019
Graph vulnerability parameters, compression, and quasi-threshold graphs.
Discret. Appl. Math., 2019

2016
A note on the values of independence polynomials at -1.
Discret. Math., 2016

On constructing rational spanning tree edge densities.
Discret. Appl. Math., 2016

2015
Best Monotone Degree Conditions for Graph Properties: A Survey.
Graphs Comb., 2015

2014
Toughness and binding number.
Discret. Appl. Math., 2014

2013
Toughness and Vertex Degrees.
J. Graph Theory, 2013

2012
Degree Sequences and the Existence of k-Factors.
Graphs Comb., 2012

2011
Best monotone degree conditions for binding number.
Discret. Math., 2011

2010
Graphs with the maximum or minimum number of 1-factors.
Discret. Math., 2010

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

2008
Long Cycles in 2-Connected Triangle-Free Graphs.
Ars Comb., 2008

2007
Generalizing D-graphs.
Discret. Appl. Math., 2007

Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discret. Appl. Math., 2007


  Loading...