Douglas Bauer

According to our database1, Douglas Bauer authored at least 45 papers between 1979 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A generalization of a theorem of Nash-Williams.
Graphs Comb., 2022

2020
On the necessity of Chvátal's Hamiltonian degree condition.
AKCE Int. J. Graphs Comb., 2020

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

2016
Vertex Arboricity and Vertex Degrees.
Graphs Comb., 2016

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

Best monotone degree conditions for binding number and cycle structure.
Discret. Appl. Math., 2015

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

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

2012
Binding Number, Minimum Degree, and Cycle Structure in Graphs.
J. Graph Theory, 2012

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

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

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
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
J. Graph Theory, 2007

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

Subdivision of Edges and Matching Size.
Ars Comb., 2007

2006
Toughness in Graphs - A Survey.
Graphs Comb., 2006

2004
Toughness, minimum degree, and spanning cubic subgraphs.
J. Graph Theory, 2004

2002
More Progress on Tough Graphs - The Y2K Report.
Electron. Notes Discret. Math., 2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discret. Appl. Math., 2002

2000
Long cycles in 3-cyclable graphs.
Discret. Math., 2000

Chordality and 2-factors in Tough Graphs.
Discret. Appl. Math., 2000

Not Every 2-tough Graph Is Hamiltonian.
Discret. Appl. Math., 2000

1997
The Complexity of Recognizing Tough Cubic Graphs.
Discret. Appl. Math., 1997

1996
2-factors in triangle-free graphs.
J. Graph Theory, 1996

A note on dominating cycles in 2-connected graphs.
Discret. Math., 1996

1995
Toughness and Triangle-Free Graphs.
J. Comb. Theory, Ser. B, 1995

Long cycles in graphs with prescribed toughness and minimum degree.
Discret. Math., 1995

On generalizing a theorem of Jung.
Ars Comb., 1995

1994
Toughness, minimum degree, and the existence of 2-factors.
J. Graph Theory, 1994

On the complexity of recognizing tough graphs.
Discret. Math., 1994

1991
Hamiltonian properties of graphs with large neighborhood unions.
Discret. Math., 1991

1990
Hamiltonian degree conditions which imply a graph is pancyclic.
J. Comb. Theory, Ser. B, 1990

Long cycles in graphs with large degree sums.
Discret. Math., 1990

A simple proof of a theorem of Jung.
Discret. Math., 1990

Recognizing tough graphs is NP-hard.
Discret. Appl. Math., 1990

1989
A generalization of a result of Häggkvist and Nicoghossian.
J. Comb. Theory, Ser. B, 1989

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

1984
Extremal non-bipartite regular graphs of girth 4.
J. Comb. Theory, Ser. B, 1984

1983
Regular <i>K</i><sub>n</sub>-free graphs.
J. Comb. Theory, Ser. B, 1983

Domination alteration sets in graphs.
Discret. Math., 1983

1982
The connectivities of line and total graphs.
J. Graph Theory, 1982

Graphs isomorphic to subgraphs of their line-graphs.
Discret. Math., 1982

1980
Line-graphical degree sequences.
J. Graph Theory, 1980

1979
Graphs with prescribed connectivity and line graph connectivity.
J. Graph Theory, 1979


  Loading...