1,023 results on '"West, Douglas B."'
Search Results
2. Trees with at least $6\ell+11$ vertices are $\ell$-reconstructible
3. Another Proof of the Generalized Tutte--Berge Formula for $f$-Bounded Subgraphs
4. Bounds for eccentricity-based parameters of graphs
5. Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
6. $2$-Reconstructibility of Weakly Distance-Regular Graphs
7. Some new results on bar visibility of digraphs
8. 2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs
9. Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable
10. On reconstruction of graphs from the multiset of subgraphs obtained by deleting $\ell$ vertices
11. The Number of Perfect Matchings in M\'obius Ladders and Prisms
12. Cycles in Color-Critical Graphs
13. 3-Regular Graphs Are 2-Reconstructible
14. On the bar visibility number of complete bipartite graphs
15. Degree lists and connectedness are $3$-reconstructible for graphs with at least seven vertices
16. Upper bounds for bar visibility of subgraphs and n-vertex graphs
17. Largest 2-regular subgraphs in 3-regular graphs
18. Sharp lower bounds for the number of maximum matchings in bipartite multigraphs
19. On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
20. Cut-edges and regular factors in regular graphs of odd degree
21. Ramsey Numbers of Interval 2-chromatic Ordered Graphs
22. The Slow-coloring Game on Sparse Graphs: $k$-Degenerate, Planar, and Outerplanar
23. The Unit Acquisition Number of a Graph
24. Extremal problems on saturation for the family of $k$-edge-connected graphs
25. Lichiardopol's conjecture on disjoint cycles in tournaments
26. Problems and Solutions.
27. Online Sum-Paintability: Slow-Coloring of Trees
28. Fractional and Circular Separation Dimension of Graphs
29. Reconstruction from $k$-decks for graphs with maximum degree 2
30. Spanning Trees in 2-trees
31. The vulnerability of the diameter of enhanced hypercubes
32. Systems of Overlap Representation for Families of Intervals
33. On-line size Ramsey number for monotone [formula omitted]-uniform ordered paths with uniform looseness
34. 3-regular graphs are 2-reconstructible
35. Strongly connectable digraphs and non-transitive dice
36. Online Paintability: The Slow-Coloring Game
37. Uniquely cycle-saturated graphs
38. Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \le 2$
39. Coloring, sparseness, and girth
40. Upper bounds for bar visibility of subgraphs and [formula omitted]-vertex graphs
41. Cut-Edges and Regular Factors in Regular Graphs of Odd Degree
42. Problems and Solutions
43. On r-dynamic Coloring of Grids
44. To catch a falling robber
45. The Game Saturation Number of a Graph
46. Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices
47. Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices
48. An Introduction to the Discharging Method via Graph Coloring
49. 1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs
50. Ramsey Numbers of Interval 2-Chromatic Ordered Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.