Douglas Bauer

According to our database, Douglas Bauer authored at least 46 papers between 1979 and 2022.

Collaborative distances:

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

2022

A generalization of a theorem of Nash-Williams.

Douglas Bauer, Linda M. Lesniak, Edward F. Schmeichel

Graphs Comb., 2022

2020

On the necessity of Chvátal's Hamiltonian degree condition.

Douglas Bauer, Linda M. Lesniak, Aori Nevo, Edward F. Schmeichel

AKCE Int. J. Graphs Comb., 2020

2017

Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor.

Douglas Bauer, Aori Nevo, Edward F. Schmeichel

Graphs Comb., 2017

2016

Vertex Arboricity and Vertex Degrees.

Douglas Bauer, Aori Nevo, Edward F. Schmeichel

Graphs Comb., 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

Best monotone degree conditions for binding number and cycle structure.

Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro

Discret. Appl. Math., 2015

2014

Toughness and binding number.

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

Discret. Appl. Math., 2014

A model for development, transition and technology transfer leading to commercialization of security technology.

Ed Rao, Jim Remer, Douglas Bauer

Proceedings of the International Carnahan Conference on Security Technology, 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

Binding Number, Minimum Degree, and Cycle Structure in Graphs.

Douglas Bauer, Edward F. Schmeichel

J. Graph Theory, 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

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

Tutte sets in graphs I: Maximal tutte sets and D-graphs.

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel

J. Graph Theory, 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

Subdivision of Edges and Matching Size.

Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec

Ars Comb., 2007

2006

Toughness in Graphs - A Survey.

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel

Graphs Comb., 2006

2004

Toughness, minimum degree, and spanning cubic subgraphs.

Douglas Bauer, T. Niessen, Edward F. Schmeichel

J. Graph Theory, 2004

2002

More Progress on Tough Graphs - The Y2K Report.

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel

Electron. Notes Discret. Math., 2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel

Discret. Appl. Math., 2002

2000

Long cycles in 3-cyclable graphs.

Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman

Discret. Math., 2000

Chordality and 2-factors in Tough Graphs.

Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman

Discret. Appl. Math., 2000

Not Every 2-tough Graph Is Hamiltonian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman

Discret. Appl. Math., 2000

1997

The Complexity of Recognizing Tough Cubic Graphs.

Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel

Discret. Appl. Math., 1997

1996

2-factors in triangle-free graphs.

Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel

J. Graph Theory, 1996

A note on dominating cycles in 2-connected graphs.

Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman

Discret. Math., 1996

1995

Toughness and Triangle-Free Graphs.

Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel

J. Comb. Theory B, 1995

Long cycles in graphs with prescribed toughness and minimum degree.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1995

On generalizing a theorem of Jung.

Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman

Ars Comb., 1995

1994

Toughness, minimum degree, and the existence of 2-factors.

Douglas Bauer, Edward F. Schmeichel

J. Graph Theory, 1994

On the complexity of recognizing tough graphs.

Douglas Bauer, Aurora Morgana, Edward F. Schmeichel

Discret. Math., 1994

1991

Hamiltonian properties of graphs with large neighborhood unions.

Douglas Bauer, Genghua Fan, Henk Jan Veldman

Discret. Math., 1991

1990

Hamiltonian degree conditions which imply a graph is pancyclic.

Douglas Bauer, Edward F. Schmeichel

J. Comb. Theory B, 1990

Long cycles in graphs with large degree sums.

Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel

Discret. Math., 1990

A simple proof of a theorem of Jung.

Douglas Bauer, Aurora Morgana, Edward F. Schmeichel

Discret. Math., 1990

Recognizing tough graphs is NP-hard.

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

Discret. Appl. Math., 1990

1989

A generalization of a result of Häggkvist and Nicoghossian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao

J. Comb. Theory B, 1989

1985

Combinatorial optimization problems in the analysis and design of probabilistic networks.

Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell

Networks, 1985

1984

Extremal non-bipartite regular graphs of girth 4.

Douglas Bauer

J. Comb. Theory B, 1984

1983

Regular <i>K</i>_n-free graphs.

Douglas Bauer

J. Comb. Theory B, 1983

Domination alteration sets in graphs.

Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel

Discret. Math., 1983

1982

The connectivities of line and total graphs.

Douglas Bauer, Ralph Tindell

J. Graph Theory, 1982

Graphs isomorphic to subgraphs of their line-graphs.

Douglas Bauer, Ralph Tindell

Discret. Math., 1982

1980

Line-graphical degree sequences.

Douglas Bauer

J. Graph Theory, 1980

1979

Graphs with prescribed connectivity and line graph connectivity.

Douglas Bauer, Ralph Tindell

J. Graph Theory, 1979