Douglas Bauer

Publication Activity (10 Years)

Years Active: 1979-2022
Publications (10 Years): 6

Top Topics

Graph Properties

Strictly Convex

Top Venues

Discret. Appl. Math.

J. Graph Theory

AKCE Int. J. Graphs Comb.

Publications

Douglas Bauer, Linda M. Lesniak, Edward F. Schmeichel
A generalization of a theorem of Nash-Williams. Graphs Comb. 38 (6) (2022)
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) (2020)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. 33 (5) (2017)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel
Vertex Arboricity and Vertex Degrees. Graphs Comb. 32 (5) (2016)
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 (2015)
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) (2015)
Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Toughness and binding number. Discret. Appl. Math. 165 (2014)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
Toughness and Vertex Degrees. J. Graph Theory 72 (2) (2013)
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) (2012)
Douglas Bauer, Edward F. Schmeichel
Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory 71 (2) (2012)
Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel
Best monotone degree conditions for binding number. Discret. Math. 311 (18-19) (2011)
Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
-edge-connectedness of a graph. Networks 54 (2) (2009)
Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel
Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. 86 (2008)
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) (2007)
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) (2007)
Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec
Subdivision of Edges and Matching Size. Ars Comb. 84 (2007)
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
Toughness in Graphs - A Survey. Graphs Comb. 22 (1) (2006)
Douglas Bauer, T. Niessen, Edward F. Schmeichel
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 46 (2) (2004)
Douglas Bauer, T. Niessen, Edward F. Schmeichel
Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory 45 (2) (2004)
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11 (2002)
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) (2002)
Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
Long cycles in 3-cyclable graphs. Discret. Math. 218 (1-3) (2000)
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99 (1-3) (2000)
Douglas Bauer, Hajo Broersma, Henk Jan Veldman
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99 (1-3) (2000)
Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. 79 (1-3) (1997)
Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
A note on dominating cycles in 2-connected graphs. Discret. Math. 155 (1-3) (1996)
Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
2-factors in triangle-free graphs. J. Graph Theory 21 (4) (1996)
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) (1995)
Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
Toughness and Triangle-Free Graphs. J. Comb. Theory, Ser. B 65 (2) (1995)
Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
On generalizing a theorem of Jung. Ars Comb. 40 (1995)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
On the complexity of recognizing tough graphs. Discret. Math. 124 (1-3) (1994)
Douglas Bauer, Edward F. Schmeichel
Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory 18 (3) (1994)
Douglas Bauer, Genghua Fan, Henk Jan Veldman
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96 (1) (1991)
Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
Long cycles in graphs with large degree sums. Discret. Math. 79 (1) (1990)
Douglas Bauer, Edward F. Schmeichel
Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory, Ser. B 48 (1) (1990)
Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28 (3) (1990)
Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
A simple proof of a theorem of Jung. Discret. Math. 79 (2) (1990)
Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao
A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47 (2) (1989)
Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15 (2) (1985)
Douglas Bauer
Extremal non-bipartite regular graphs of girth 4. J. Comb. Theory, Ser. B 37 (1) (1984)
Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
Domination alteration sets in graphs. Discret. Math. 47 (1983)
Douglas Bauer
-free graphs. J. Comb. Theory, Ser. B 35 (2) (1983)
Douglas Bauer, Ralph Tindell
Graphs isomorphic to subgraphs of their line-graphs. Discret. Math. 41 (1) (1982)
Douglas Bauer, Ralph Tindell
The connectivities of line and total graphs. J. Graph Theory 6 (2) (1982)
Douglas Bauer
Line-graphical degree sequences. J. Graph Theory 4 (2) (1980)
Douglas Bauer, Ralph Tindell
Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3 (4) (1979)