116 results on '"Douglas Bauer"'
Search Results
2. Cell Cycle Arrest and Apoptosis Induction by a New 2,4-Dinitrobenzenesulfonamide Derivative In Acute Leukemia Cells
3. Copyright
4. Title Page
5. Autumn
6. Prologue
7. Spring
8. Notes and Acknowledgments, Dedication, Epigraph
9. Winter
10. Insights into the bisphosphonate-holiday: A preliminary FTIRI study
11. A generalization of a theorem of Nash-Williams.
12. Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor.
13. Vertex Arboricity and Vertex Degrees.
14. A model for development, transition and technology transfer leading to commercialization of security technology.
15. Best monotone degree conditions for binding number and cycle structure.
16. Best Monotone Degree Conditions for Graph Properties: A Survey.
17. The Beckoning World
18. Toughness and binding number.
19. Toughness and Vertex Degrees.
20. Binding Number, Minimum Degree, and Cycle Structure in Graphs.
21. Degree Sequences and the Existence of k-Factors.
22. Best monotone degree conditions for binding number.
23. Sufficient degree conditions for k-edge-connectedness of a graph.
24. Tutte sets in graphs I: Maximal tutte sets and D-graphs.
25. Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
26. Toughness in Graphs - A Survey.
27. What Happens Next?: Matters of Life and Death
28. Toughness, minimum degree, and spanning cubic subgraphs.
29. Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
30. More Progress on Tough Graphs - The Y2K Report.
31. Long cycles in 3-cyclable graphs.
32. Chordality and 2-factors in Tough Graphs.
33. Not Every 2-tough Graph Is Hamiltonian.
34. The Complexity of Recognizing Tough Cubic Graphs.
35. 2-factors in triangle-free graphs.
36. A note on dominating cycles in 2-connected graphs.
37. Long cycles in graphs with prescribed toughness and minimum degree.
38. Toughness and Triangle-Free Graphs.
39. Toughness, minimum degree, and the existence of 2-factors.
40. On the complexity of recognizing tough graphs.
41. Hamiltonian properties of graphs with large neighborhood unions.
42. Diabetes mellitus and the benefit of antiresorptive therapy on fracture risk
43. Long Cycles in 2-Connected Triangle-Free Graphs.
44. A simple proof of a theorem of Jung.
45. Long cycles in graphs with large degree sums.
46. Recognizing tough graphs is NP-hard.
47. Hamiltonian degree conditions which imply a graph is pancyclic.
48. Subdivision of Edges and Matching Size.
49. The Beckoning World : A Novel
50. On generalizing a theorem of Jung.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.