The following pages link to Douglas B. West (Q185079):
Displayed 50 items.
- Cut-edges and regular factors in regular graphs of odd degree (Q2657077) (← links)
- \(3\)-reconstructibility of rooted trees (Q2694954) (← links)
- (Q2741343) (← links)
- Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs (Q2753541) (← links)
- Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196) (← links)
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551) (← links)
- Visibility Number of Directed Graphs (Q2870514) (← links)
- Degree Ramsey Numbers of Graphs (Q2883865) (← links)
- Overlap number of graphs (Q2888876) (← links)
- Packing of graphic n-tuples (Q2888877) (← links)
- Spanning Cycles Through Specified Edges in Bipartite Graphs (Q2911049) (← links)
- The A4-structure of a graph (Q2911060) (← links)
- (Q2951140) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- (Q3015590) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- A new proof of 3-colorability of Eulerian triangulations (Q3119059) (← links)
- (Q3138293) (← links)
- (Q3166002) (← links)
- (Q3204503) (← links)
- Bisection of Circle Colorings (Q3222851) (← links)
- Spanning Trees with Many Leaves (Q3360890) (← links)
- Long Local Searches for Maximal Bipartite Subgraphs (Q3394991) (← links)
- Circular chromatic index of Cartesian products of graphs (Q3539926) (← links)
- Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable (Q3563947) (← links)
- On the Pagenumber of <i>k</i>-Trees (Q3583318) (← links)
- Matching Extendability in Hypercubes (Q3583324) (← links)
- Extremal Problems for Roman Domination (Q3583327) (← links)
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs (Q3632998) (← links)
- Implications among linkage properties in graphs (Q3633014) (← links)
- Triangle-free planar graphs with minimum degree 3 have radius at least 3 (Q3633847) (← links)
- (Q3684157) (← links)
- (Q3691774) (← links)
- (Q3714105) (← links)
- (Q3773921) (← links)
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs (Q3797213) (← links)
- An improved edge bound on the interval number of a graph (Q3798701) (← links)
- Pagenumber of complete bipartite graphs (Q3812259) (← links)
- (Q3838186) (← links)
- Gossiping without Duplicate Transmissions (Q3960730) (← links)
- (Q3964569) (← links)
- Extremal Values of the Interval Number of a Graph (Q3964599) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- Adding up to Powers (Q3982583) (← links)
- (Q4010305) (← links)
- Pairs of Adjacent Hamiltonian Circuits with Small Intersection (Q4182254) (← links)
- The Bricklayer Problem and the Strong Cycle Lemma (Q4221592) (← links)
- The leafage of a chordal graph (Q4222379) (← links)
- (Q4242965) (← links)
- Diagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs (Q4268721) (← links)