The following pages link to Douglas B. West (Q185079):
Displaying 50 items.
- (Q4304403) (← links)
- A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem (Q4326854) (← links)
- (Q4337507) (← links)
- (Q4390656) (← links)
- (Q4390687) (← links)
- Isometric cycles, cutsets, and crowning of bridged graphs (Q4416301) (← links)
- A list analogue of equitable coloring (Q4446890) (← links)
- (Q4489219) (← links)
- Multiple vertex coverings by specified induced subgraphs (Q4489493) (← links)
- Connected Domination and Spanning Trees with Many Leaves (Q4490780) (← links)
- The edge-bandwidth of theta graphs (Q4518334) (← links)
- Reconstruction from the deck of ‐vertex induced subgraphs (Q4632019) (← links)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle (Q4655902) (← links)
- Large <i>P</i><sub>4</sub>‐free graphs with bounded degree (Q4693348) (← links)
- Edge-Bandwidth of Graphs (Q4699159) (← links)
- The superregular graphs (Q4715282) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Coloring of trees with minimum sum of colors (Q4719325) (← links)
- The Borsuk-Ulam Theorem and Bisection of Necklaces (Q4722077) (← links)
- The 2‐intersection number of paths and bounded‐degree trees (Q4842702) (← links)
- Maximum Bandwidth Under Edge Addition (Q4843508) (← links)
- (Q4869540) (← links)
- (Q4871039) (← links)
- (Q4871087) (← links)
- The Total Interval Number of a Graph II: Trees and Complexity (Q4881297) (← links)
- (Q4949848) (← links)
- On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (Q5001714) (← links)
- (Q5110817) (← links)
- Strongly connectable digraphs and non-transitive dice (Q5154618) (← links)
- On the Bar Visibility Number of Complete Bipartite Graphs (Q5157389) (← links)
- Uniquely Cycle‐Saturated Graphs (Q5272635) (← links)
- The Game Saturation Number of a Graph (Q5272930) (← links)
- (Q5311854) (← links)
- The Bar Visibility Number of a Graph (Q5317561) (← links)
- Precoloring Extensions of Brooks' Theorem (Q5317568) (← links)
- Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) (← links)
- (Q5405504) (← links)
- Total Acquisition in Graphs (Q5408594) (← links)
- Extremal Problems for Game Domination Number (Q5408611) (← links)
- (Q5443201) (← links)
- (Q5443247) (← links)
- Pebbling and optimal pebbling in graphs (Q5450348) (← links)
- Chvátal's Condition cannot hold for both a graph and its complement (Q5492687) (← links)
- (Q5708587) (← links)
- (Q5708606) (← links)
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts (Q5711696) (← links)
- Problems and Solutions (Q5894364) (← links)
- Problems and Solutions (Q5894435) (← links)
- On the number of vertices with specified eccentricity (Q5935604) (← links)
- Realizing degree imbalances in directed graphs (Q5946755) (← links)
