default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathan Kahl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Nathan Kahl
, Kristi Luttrell:
On maximum graphs in Tutte polynomial posets. Discret. Appl. Math. 339: 78-88 (2023)- 2022
- [j16]Nathan Kahl:
Extremal graphs for the Tutte polynomial. J. Comb. Theory B 152: 121-152 (2022) - [j15]Daniel Gross, Nathan Kahl, Kristi Luttrell, John T. Saccoman:
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend. Networks 80(4): 431-439 (2022) - 2021
- [j14]Nathan Kahl:
Graph vulnerability parameters, compression, and threshold graphs. Discret. Appl. Math. 292: 108-116 (2021)
2010 – 2019
- 2019
- [j13]Nathan Kahl:
Graph vulnerability parameters, compression, and quasi-threshold graphs. Discret. Appl. Math. 259: 119-126 (2019) - 2016
- [j12]Nathan Kahl:
On constructing rational spanning tree edge densities. Discret. Appl. Math. 213: 224-232 (2016) - [j11]Jonathan Cutler, Nathan Kahl:
A note on the values of independence polynomials at -1. Discret. Math. 339(11): 2723-2726 (2016) - 2015
- [j10]Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31(1): 1-22 (2015) - 2014
- [j9]Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Toughness and binding number. Discret. Appl. Math. 165: 60-68 (2014) - 2013
- [j8]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Toughness and Vertex Degrees. J. Graph Theory 72(2): 209-219 (2013) - 2012
- [j7]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28(2): 149-166 (2012) - 2011
- [j6]Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel:
Best monotone degree conditions for binding number. Discret. Math. 311(18-19): 2037-2043 (2011) - 2010
- [j5]Daniel Gross, Nathan Kahl, John T. Saccoman:
Graphs with the maximum or minimum number of 1-factors. Discret. Math. 310(4): 687-691 (2010)
2000 – 2009
- 2009
- [j4]Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel:
Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009) - 2008
- [j3]Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel:
Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86 (2008) - 2007
- [j2]Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155(10): 1336-1343 (2007) - [j1]Arthur H. Busch, Michael Ferrara, Nathan Kahl:
Generalizing D-graphs. Discret. Appl. Math. 155(18): 2487-2495 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
