The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Douglas Bauer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
    Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal]
  2. Douglas Bauer, Hajo Broersma, Henk Jan Veldman
    Not Every 2-tough Graph Is Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:317-321 [Journal]
  3. Douglas Bauer, Willem-Jan van den Heuvel, Aurora Morgana, Edward F. Schmeichel
    The Complexity of Recognizing Tough Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:35-44 [Journal]
  4. Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
    Chordality and 2-factors in Tough Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:323-329 [Journal]
  5. Douglas Bauer, Hajo Broersma, N. Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec
    Tutte sets in graphs II: The complexity of finding maximum Tutte sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1336-1343 [Journal]
  6. Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
    Long cycles in 3-cyclable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:1-8 [Journal]
  7. Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
    Toughness in Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:1, pp:1-35 [Journal]
  8. Douglas Bauer
    Regular Kn-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:2, pp:193-200 [Journal]
  9. Douglas Bauer
    Extremal non-bipartite regular graphs of girth 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:64-69 [Journal]
  10. Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao
    A generalization of a result of Häggkvist and Nicoghossian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:237-243 [Journal]
  11. Douglas Bauer, Willem-Jan van den Heuvel, Edward F. Schmeichel
    Toughness and Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:2, pp:208-221 [Journal]
  12. Douglas Bauer, Edward F. Schmeichel
    Hamiltonian degree conditions which imply a graph is pancyclic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:111-116 [Journal]
  13. Douglas Bauer, T. Niessen, Edward F. Schmeichel
    Toughness, minimum degree, and spanning cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:2, pp:144- [Journal]
  14. Douglas Bauer, T. Niessen, Edward F. Schmeichel
    Toughness, minimum degree, and spanning cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:2, pp:119-141 [Journal]
  15. Douglas Bauer, Ralph Tindell
    Graphs isomorphic to subgraphs of their line-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:1-6 [Journal]
  16. Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
    Domination alteration sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:153-161 [Journal]
  17. Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
    Long cycles in graphs with large degree sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:1, pp:59-70 [Journal]
  18. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    A simple proof of a theorem of Jung. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:2, pp:147-152 [Journal]
  19. Douglas Bauer, Genghua Fan, Henk Jan Veldman
    Hamiltonian properties of graphs with large neighborhood unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:1, pp:33-49 [Journal]
  20. Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman
    Long cycles in graphs with prescribed toughness and minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:1-10 [Journal]
  21. Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
    A note on dominating cycles in 2-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:155, n:1-3, pp:13-18 [Journal]
  22. Douglas Bauer, Aurora Morgana, Edward F. Schmeichel
    On the complexity of recognizing tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:124, n:1-3, pp:13-17 [Journal]

  23. Long Cycles in 2-Connected Triangle-Free Graphs. [Citation Graph (, )][DBLP]


  24. Subdivision of Edges and Matching Size. [Citation Graph (, )][DBLP]


  25. Recognizing tough graphs is NP-hard. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.047secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002