Douglas Bauer - RankMe

47 papers Journal 46Unranked 1

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	A generalization of a theorem of Nash-Williams. Graphs Comb. Douglas Bauer, Linda M. Lesniak, Edward F. Schmeichel
2020	J	`jnl`	On the necessity of Chvátal's Hamiltonian degree condition. AKCE Int. J. Graphs Comb. Douglas Bauer, Linda M. Lesniak, Aori Nevo, Edward F. Schmeichel
2017	J	`jnl`	Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. Graphs Comb. Douglas Bauer, Aori Nevo, Edward F. Schmeichel
2016	J	`jnl`	Vertex Arboricity and Vertex Degrees. Graphs Comb. Douglas Bauer, Aori Nevo, Edward F. Schmeichel
2015	J	`jnl`	Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
2015	J	`jnl`	Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
2014	—	`conf`	A model for development, transition and technology transfer leading to commercialization of security technology. ICCST Ed Rao, Jim Remer, Douglas Bauer
2014	J	`jnl`	Toughness and binding number. Discret. Appl. Math. Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
2013	J	`jnl`	Toughness and Vertex Degrees. J. Graph Theory Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2012	J	`jnl`	Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory Douglas Bauer, Edward F. Schmeichel
2012	J	`jnl`	Degree Sequences and the Existence of k-Factors. Graphs Comb. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2011	J	`jnl`	Best monotone degree conditions for binding number. Discret. Math. Douglas Bauer, Michael Yatauro, Nathan Kahl, Edward F. Schmeichel
2009	J	`jnl`	Sufficient degree conditions for Networks Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel
2008	J	`jnl`	Long Cycles in 2-Connected Triangle-Free Graphs. Ars Comb. Douglas Bauer, Nathan Kahl, Linda E. McGuire, Edward F. Schmeichel
2007	J	`jnl`	Subdivision of Edges and Matching Size. Ars Comb. Douglas Bauer, Edward F. Schmeichel, Thomas M. Surowiec
2007	J	`jnl`	Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
2007	J	`jnl`	Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec
2006	J	`jnl`	Toughness in Graphs - A Survey. Graphs Comb. Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
2004	J	`jnl`	Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory Douglas Bauer, T. Niessen, Edward F. Schmeichel
2004	J	`jnl`	Toughness, minimum degree, and spanning cubic subgraphs. J. Graph Theory Douglas Bauer, T. Niessen, Edward F. Schmeichel
2002	J	`jnl`	More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
2002	J	`jnl`	Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
2000	J	`jnl`	Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
2000	J	`jnl`	Long cycles in 3-cyclable graphs. Discret. Math. Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
2000	J	`jnl`	Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. Douglas Bauer, Hajo Broersma, Henk Jan Veldman
1997	J	`jnl`	The Complexity of Recognizing Tough Cubic Graphs. Discret. Appl. Math. Douglas Bauer, Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
1996	J	`jnl`	2-factors in triangle-free graphs. J. Graph Theory Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
1996	J	`jnl`	A note on dominating cycles in 2-connected graphs. Discret. Math. Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
1995	J	`jnl`	Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1995	J	`jnl`	On generalizing a theorem of Jung. Ars Comb. Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
1995	J	`jnl`	Toughness and Triangle-Free Graphs. J. Comb. Theory B Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel
1994	J	`jnl`	On the complexity of recognizing tough graphs. Discret. Math. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
1994	J	`jnl`	Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory Douglas Bauer, Edward F. Schmeichel
1991	J	`jnl`	Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. Douglas Bauer, Genghua Fan, Henk Jan Veldman
1990	J	`jnl`	A simple proof of a theorem of Jung. Discret. Math. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
1990	J	`jnl`	Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory B Douglas Bauer, Edward F. Schmeichel
1990	J	`jnl`	Long cycles in graphs with large degree sums. Discret. Math. Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
1990	J	`jnl`	Recognizing tough graphs is NP-hard. Discret. Appl. Math. Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel
1989	J	`jnl`	A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory B Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao
1985	J	`jnl`	Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell
1984	J	`jnl`	Extremal non-bipartite regular graphs of girth 4. J. Comb. Theory B Douglas Bauer
1983	J	`jnl`	Domination alteration sets in graphs. Discret. Math. Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
1983	J	`jnl`	Regular J. Comb. Theory B Douglas Bauer
1982	J	`jnl`	Graphs isomorphic to subgraphs of their line-graphs. Discret. Math. Douglas Bauer, Ralph Tindell
1982	J	`jnl`	The connectivities of line and total graphs. J. Graph Theory Douglas Bauer, Ralph Tindell
1980	J	`jnl`	Line-graphical degree sequences. J. Graph Theory Douglas Bauer
1979	J	`jnl`	Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory Douglas Bauer, Ralph Tindell