default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDouglas Bauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j46]Douglas Bauer
, Linda M. Lesniak, Edward F. Schmeichel:
A generalization of a theorem of Nash-Williams. Graphs Comb. 38(6): 184 (2022)- 2020
- [j45]Douglas Bauer, Linda M. Lesniak, Aori Nevo, Edward F. Schmeichel:
On the necessity of Chvátal's Hamiltonian degree condition. AKCE Int. J. Graphs Comb. 17(2): 665-669 (2020)
2010 – 2019
- 2017
- [j44]Douglas Bauer, Aori Nevo, Edward F. Schmeichel:
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. 33(5): 1231-1248 (2017) - 2016
- [j43]Douglas Bauer, Aori Nevo, Edward F. Schmeichel:
Vertex Arboricity and Vertex Degrees. Graphs Comb. 32(5): 1699-1705 (2016) - 2015
- [j42]Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. 195: 8-17 (2015) - [j41]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
- [j40]Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Toughness and binding number. Discret. Appl. Math. 165: 60-68 (2014) - 2013
- [j39]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
- [j38]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) - [j37]Douglas Bauer, Edward F. Schmeichel:
Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory 71(2): 219-228 (2012) - 2011
- [j36]Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel:
Best monotone degree conditions for binding number. Discret. Math. 311(18-19): 2037-2043 (2011)
2000 – 2009
- 2009
- [j35]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
- [j34]Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel:
Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86 (2008) - 2007
- [j33]Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec:
Subdivision of Edges and Matching Size. Ars Comb. 84 (2007) - [j32]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) - [j31]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55(4): 343-358 (2007) - 2006
- [j30]Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
Toughness in Graphs - A Survey. Graphs Comb. 22(1): 1-35 (2006) - 2004
- [j29]Douglas Bauer, T. Niessen, Edward F. Schmeichel:
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 45(2): 119-141 (2004) - [j28]Douglas Bauer, T. Niessen, Edward F. Schmeichel:
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 46(2): 144 (2004) - 2002
- [j27]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002) - [j26]Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11: 63-80 (2002) - 2000
- [j25]Douglas Bauer, Hajo Broersma, Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99(1-3): 317-321 (2000) - [j24]Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99(1-3): 323-329 (2000) - [j23]Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman:
Long cycles in 3-cyclable graphs. Discret. Math. 218(1-3): 1-8 (2000)
1990 – 1999
- 1997
- [j22]Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel:
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79(1-3): 35-44 (1997) - 1996
- [j21]Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman:
A note on dominating cycles in 2-connected graphs. Discret. Math. 155(1-3): 13-18 (1996) - [j20]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
2-factors in triangle-free graphs. J. Graph Theory 21(4): 405-412 (1996) - 1995
- [j19]Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman:
On generalizing a theorem of Jung. Ars Comb. 40 (1995) - [j18]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141(1-3): 1-10 (1995) - [j17]Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
Toughness and Triangle-Free Graphs. J. Comb. Theory B 65(2): 208-221 (1995) - 1994
- [j16]Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
On the complexity of recognizing tough graphs. Discret. Math. 124(1-3): 13-17 (1994) - [j15]Douglas Bauer, Edward F. Schmeichel:
Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory 18(3): 241-256 (1994) - 1991
- [j14]Douglas Bauer, Genghua Fan, Henk Jan Veldman:
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96(1): 33-49 (1991) - 1990
- [j13]Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28(3): 191-195 (1990) - [j12]Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel:
Long cycles in graphs with large degree sums. Discret. Math. 79(1): 59-70 (1990) - [j11]Douglas Bauer, Aurora Morgana, Edward F. Schmeichel:
A simple proof of a theorem of Jung. Discret. Math. 79(2): 147-152 (1990) - [j10]Douglas Bauer, Edward F. Schmeichel:
Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory B 48(1): 111-116 (1990)
1980 – 1989
- 1989
- [j9]Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao:
A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory B 47(2): 237-243 (1989) - 1985
- [j8]Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell:
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15(2): 257-271 (1985) - 1984
- [j7]Douglas Bauer:
Extremal non-bipartite regular graphs of girth 4. J. Comb. Theory B 37(1): 64-69 (1984) - 1983
- [j6]Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel:
Domination alteration sets in graphs. Discret. Math. 47: 153-161 (1983) - [j5]Douglas Bauer:
Regular Kn-free graphs. J. Comb. Theory B 35(2): 193-200 (1983) - 1982
- [j4]Douglas Bauer, Ralph Tindell:
Graphs isomorphic to subgraphs of their line-graphs. Discret. Math. 41(1): 1-6 (1982) - [j3]Douglas Bauer, Ralph Tindell:
The connectivities of line and total graphs. J. Graph Theory 6(2): 197-203 (1982) - 1980
- [j2]Douglas Bauer:
Line-graphical degree sequences. J. Graph Theory 4(2): 219-232 (1980)
1970 – 1979
- 1979
- [j1]Douglas Bauer, Ralph Tindell:
Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3(4): 393-395 (1979)
Coauthor Index
aka: Haitze J. Broersma
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-07 22:22 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:
