Douglas Bauer

发表

Vertex Arboricity and Vertex Degrees

Edward F. Schmeichel, Douglas Bauer, A. Nevo, 2016, Graphs Comb..

Progress on tough graphs - Another four years

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1996 .

Toughness and Vertex Degrees

Edward F. Schmeichel, Douglas Bauer, Jan van den Heuvel, 2009, J. Graph Theory.

Chordality and 2-factors in Tough Graphs

Dieter Kratsch, Douglas Bauer, Henk Jan Veldman, 2000, Discret. Appl. Math..

On the complexity of recognizing tough graphs

Edward F. Schmeichel, Douglas Bauer, Aurora Morgana, 1994, Discret. Math..

A generalization of a result of Häggkvist and Nicoghossian

Douglas Bauer, Li Rao, Hajo Broersma, 1989, J. Comb. Theory, Ser. B.

A simple proof of a theorem of Jung

Edward F. Schmeichel, Douglas Bauer, Aurora Morgana, 1990, Discret. Math..

Tutte sets in graphs I: Maximal tutte sets and D‐graphs

Edward F. Schmeichel, Douglas Bauer, Hajo Broersma, 2007, J. Graph Theory.

Best monotone degree conditions for binding number and cycle structure

Douglas R. Woodall, Edward F. Schmeichel, Douglas Bauer, 2015, Discret. Appl. Math..

More Progress on Tough Graphs - The Y2K Report

Edward F. Schmeichel, Douglas Bauer, Hajo Broersma, 2002, Electron. Notes Discret. Math..

Toughness and Triangle-Free Graphs

Edward F. Schmeichel, Douglas Bauer, Jan van den Heuvel, 1995, J. Comb. Theory, Ser. B.

Not Every 2-tough Graph Is Hamiltonian

Douglas Bauer, Hajo Broersma, Henk Jan Veldman, 2000, Discret. Appl. Math..

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

Edward F. Schmeichel, Douglas Bauer, Hajo Broersma, 2002, Discret. Appl. Math..

Line-graphical degree sequences

Douglas Bauer, 1980, J. Graph Theory.

Extremal non-bipartite regular graphs of girth 4

Douglas Bauer, D. Bauer, 1984, J. Comb. Theory, Ser. B.

Graphs isomorphic to subgraphs of their line-graphs

Douglas Bauer, Ralph Tindell, 1982, Discret. Math..

Long Cycles in 2-Connected Triangle-Free Graphs

Edward F. Schmeichel, Douglas Bauer, Nathan Kahl, 2008, Ars Comb..

On smallest nonhamiltonian regular tough graphs

Douglas Bauer, Henk Jan Veldman, Haitze J. Broersma, 1990 .

Long cycles in graphs with prescribed toughness and minimum degree

Douglas Bauer, Jan van den Heuvel, Henk Jan Veldman, 1995, Discret. Math..

Hamiltonian degree conditions which imply a graph is pancyclic

Edward F. Schmeichel, Douglas Bauer, 1990, J. Comb. Theory, Ser. B.

Regular Kn-free graphs

Douglas Bauer, D. Bauer, 1983, J. Comb. Theory, Ser. B.

Hamiltonian properties of graphs with large neighborhood unions

Douglas Bauer, Henk Jan Veldman, Genghua Fan, 1991, Discret. Math..

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

Edward F. Schmeichel, Douglas Bauer, E. Schmeichel, 1994, J. Graph Theory.

Subdivision of Edges and Matching Size

Edward F. Schmeichel, Douglas Bauer, Thomas M. Surowiec, 2007, Ars Comb..

Graphs with prescribed connectivity and line graph connectivity

Douglas Bauer, Ralph Tindell, R. Tindell, 1979, J. Graph Theory.

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Edward F. Schmeichel, Douglas Bauer, Hajo Broersma, 2007, Discret. Appl. Math..

Domination alteration sets in graphs

Frank Harary, Douglas Bauer, Charles L. Suffel, 1983, Discret. Math..

Binding Number, Minimum Degree, and Cycle Structure in Graphs

Edward F. Schmeichel, Douglas Bauer, 2012, J. Graph Theory.

A note on dominating cycles in 2-connected graphs

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1996, Discret. Math..

2-factors in Triangle-free Graphs

Edward F. Schmeichel, Douglas Bauer, Jan van den Heuvel, 1996, Journal of Graph Theory.

The connectivities of line and total graphs

Douglas Bauer, Ralph Tindell, 1982, J. Graph Theory.

Combinatorial optimization problems in the analysis and design of probabilistic networks

Douglas Bauer, Charles L. Suffel, Ralph Tindell, 1985, Networks.

Long cycles in graphs with large degree sums

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1990, Discret. Math..

Toughness, minimum degree, and spanning cubic subgraphs

Edward F. Schmeichel, Douglas Bauer, T. Niessen, 2004, J. Graph Theory.

Degree Sequences and the Existence of k-Factors

Edward F. Schmeichel, Douglas Bauer, Jan van den Heuvel, 2012, Graphs Comb..

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

Edward F. Schmeichel, Douglas Bauer, A. Nevo, 2017, Graphs Comb..

Long cycles in 3-cyclable graphs

Douglas Bauer, Henk Jan Veldman, Linda E. McGuire, 2000, Discret. Math..

Toughness in Graphs – A Survey

Edward F. Schmeichel, Douglas Bauer, Hajo Broersma, 2006, Graphs Comb..

Toughness and binding number

Douglas R. Woodall, Edward F. Schmeichel, Douglas Bauer, 2014, Discret. Appl. Math..

Best monotone degree conditions for binding number

Edward F. Schmeichel, Douglas Bauer, Nathan Kahl, 2011, Discret. Math..

The Complexity of Recognizing Tough Cubic Graphs

Edward F. Schmeichel, Douglas Bauer, Jan van den Heuvel, 1997, Discret. Appl. Math..

Recognizing tough graphs is NP-hard

S. Louis Hakimi, Edward F. Schmeichel, Douglas Bauer, 1990, Discret. Appl. Math..

Sufficient degree conditions for k‐edge‐connectedness of a graph

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

On generalizing a theorem of Jung

Douglas Bauer, Henk Jan Veldman, Haitze J. Broersma, 1995, Ars Comb..

2-factors in triangle-free graphs

Edward F. Schmeichel, Douglas Bauer, J. van den Heuvel, 1996 .

Cycles in tough graphs

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1992 .

Around Three Lemmas in Hamiltonian Graph Theory

Douglas Bauer, Henk Jan Veldman, Haitze J. Broersma, 1990 .

Toughness and the Cycle Structure of Graphs

Edward F. Schmeichel, Douglas Bauer, E. Schmeichel, 1993 .

Some recent results on long cycles in tough graphs

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1991 .

Cycles in tough graphs- updating the last four years

Edward F. Schmeichel, Douglas Bauer, Henk Jan Veldman, 1995 .

On Hamiltonian properties of 2-tough graphs

Douglas Bauer, Henk Jan Veldman, Haitze J. Broersma, 1992 .