Douglas Bauer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2022

A generalization of a theorem of Nash-WilliamsDouglas Bauer, Linda M. Lesniak, Edward F. Schmeichel. gc, 38(6):184, 2022. [doi]

2020

On the necessity of Chvátal's Hamiltonian degree conditionDouglas Bauer, Linda Lesniak, Aori Nevo, Edward F. Schmeichel. akcej, 17(2):665-669, 2020. [doi]

2017

Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-FactorDouglas Bauer, A. Nevo, Edward F. Schmeichel. gc, 33(5):1231-1248, 2017. [doi]

2016

Vertex Arboricity and Vertex DegreesDouglas Bauer, A. Nevo, Edward F. Schmeichel. gc, 32(5):1699-1705, 2016. [doi]

2015

Best monotone degree conditions for binding number and cycle structureDouglas Bauer, A. Nevo, Edward F. Schmeichel, Douglas R. Woodall, M. Yatauro. DAM, 195:8-17, 2015. [doi]

Best Monotone Degree Conditions for Graph Properties: A SurveyDouglas Bauer, Hajo Broersma, Johan H. C. van den Heuvel, Nathan Kahl, A. Nevo, Edward F. Schmeichel, Douglas R. Woodall, M. Yatauro. gc, 31(1):1-22, 2015. [doi]

2014

Toughness and binding numberDouglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, M. Yatauro. DAM, 165:60-68, 2014. [doi]

2013

Toughness and Vertex DegreesDouglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel. jgt, 72(2):209-219, 2013. [doi]

2012

Binding Number, Minimum Degree, and Cycle Structure in GraphsDouglas Bauer, Edward F. Schmeichel. jgt, 71(2):219-228, 2012. [doi]

Degree Sequences and the Existence of k-FactorsDouglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel. gc, 28(2):149-166, 2012. [doi]

2011

Best monotone degree conditions for binding numberDouglas Bauer, M. Yatauro, Nathan Kahl, Edward F. Schmeichel. DM, 311(18-19):2037-2043, 2011. [doi]

2009

Sufficient degree conditions for ::::k::::-edge-connectedness of a graphDouglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel. networks, 54(2):95-98, 2009. [doi]

2008

Long Cycles in 2-Connected Triangle-Free GraphsDouglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel. arscom, 86, 2008.

2007

2006

Toughness in Graphs - A SurveyDouglas Bauer, Hajo Broersma, Edward F. Schmeichel. gc, 22(1):1-35, 2006. [doi]

2004

Toughness, minimum degree, and spanning cubic subgraphsDouglas Bauer, T. Niessen, Edward F. Schmeichel. jgt, 45(2):119-141, 2004. [doi]

Toughness, minimum degree, and spanning cubic subgraphsDouglas Bauer, T. Niessen, Edward F. Schmeichel. jgt, 46(2):144, 2004. [doi]

2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusionDouglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel. DAM, 120(1-3):13-23, 2002.

More Progress on Tough Graphs - The Y2K ReportDouglas Bauer, Hajo Broersma, Edward F. Schmeichel. endm, 11:63-80, 2002. [doi]

2000

Chordality and 2-factors in Tough GraphsDouglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman. DAM, 99(1-3):323-329, 2000. [doi]

Long cycles in 3-cyclable graphsDouglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman. DM, 218(1-3):1-8, 2000. [doi]

Not Every 2-tough Graph Is HamiltonianDouglas Bauer, Hajo Broersma, Henk Jan Veldman. DAM, 99(1-3):317-321, 2000. [doi]

1997

The Complexity of Recognizing Tough Cubic GraphsDouglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel. DAM, 79(1-3):35-44, 1997. [doi]

1996

A note on dominating cycles in 2-connected graphsDouglas Bauer, Edward F. Schmeichel, Henk Jan Veldman. DM, 155(1-3):13-18, 1996. [doi]

2-factors in triangle-free graphsDouglas Bauer, Jan van den Heuvel, Edward F. Schmeichel. jgt, 21(4):405-412, 1996. [doi]

1995

Long cycles in graphs with prescribed toughness and minimum degreeDouglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 141(1-3):1-10, 1995. [doi]

On generalizing a theorem of JungDouglas Bauer, H. J. Broersma, Henk Jan Veldman. arscom, 40, 1995.

Toughness and Triangle-Free GraphsDouglas Bauer, Willem-Jan van den Heuvel, Edward F. Schmeichel. JCT, 65(2):208-221, 1995. [doi]

1994

On the complexity of recognizing tough graphsDouglas Bauer, Aurora Morgana, Edward F. Schmeichel. DM, 124(1-3):13-17, 1994. [doi]

1991

Hamiltonian properties of graphs with large neighborhood unionsDouglas Bauer, Genghua Fan, Henk Jan Veldman. DM, 96(1):33-49, 1991. [doi]

1990

Long cycles in graphs with large degree sumsDouglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel. DM, 79(1):59-70, 1990. [doi]

A simple proof of a theorem of JungDouglas Bauer, Aurora Morgana, Edward F. Schmeichel. DM, 79(2):147-152, 1990. [doi]

Recognizing tough graphs is NP-hardDouglas Bauer, S. Louis Hakimi, Edward F. Schmeichel. DAM, 28(3):191-195, 1990. [doi]

Hamiltonian degree conditions which imply a graph is pancyclicDouglas Bauer, Edward F. Schmeichel. JCT, 48(1):111-116, 1990. [doi]

1989

A generalization of a result of Häggkvist and NicoghossianDouglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao. JCT, 47(2):237-243, 1989. [doi]

1985

Combinatorial optimization problems in the analysis and design of probabilistic networksDouglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell. networks, 15(2):257-271, 1985. [doi]

1984

Extremal non-bipartite regular graphs of girth 4Douglas Bauer. JCT, 37(1):64-69, 1984. [doi]

1983

Regular ::::K::::::n::-free graphsDouglas Bauer. JCT, 35(2):193-200, 1983. [doi]

Domination alteration sets in graphsDouglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel. DM, 47:153-161, 1983. [doi]

1982

Graphs isomorphic to subgraphs of their line-graphsDouglas Bauer, Ralph Tindell. DM, 41(1):1-6, 1982. [doi]

The connectivities of line and total graphsDouglas Bauer, Ralph Tindell. jgt, 6(2):197-203, 1982. [doi]

1980

Line-graphical degree sequencesDouglas Bauer. jgt, 4(2):219-232, 1980. [doi]

1979

Graphs with prescribed connectivity and line graph connectivityDouglas Bauer, Ralph Tindell. jgt, 3(4):393-395, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL