The following pages link to David R. Wood (Q259169):
Displaying 50 items.
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- Minimum Degree and Graph Minors (Q5300986) (← links)
- Compatible Geometric Matchings (Q5301007) (← links)
- A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009) (← links)
- Layout of Graphs with Bounded Tree-Width (Q5317164) (← links)
- Treewidth of Cartesian Products of Highly Connected Graphs (Q5325943) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- Forcing a sparse minor (Q5366891) (← links)
- ‘Forcing a sparse minor’ — CORRIGENDUM (Q5366892) (← links)
- Bad News for Chordal Partitions (Q5379811) (← links)
- (Q5387656) (← links)
- (Q5387660) (← links)
- (Q5387693) (← links)
- (Q5387696) (← links)
- (Q5387727) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- (Q5403002) (← links)
- On the book thickness of $k$-trees (Q5403004) (← links)
- On the General Position Subset Selection Problem (Q5408587) (← links)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph (Q5408591) (← links)
- On the Upward Planarity of Mixed Plane Graphs (Q5417598) (← links)
- (Q5480768) (← links)
- (Q5487920) (← links)
- (Q5506519) (← links)
- Graph Drawing (Q5711597) (← links)
- Graph Drawing (Q5711598) (← links)
- Graph Drawing (Q5711629) (← links)
- Graph Drawing (Q5711639) (← links)
- Computing and Combinatorics (Q5717008) (← links)
- The Size Ramsey Number of Graphs with Bounded Treewidth (Q5854459) (← links)
- Extremal functions for sparse minors (Q5871274) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897554) (← links)
- Graph Drawing (Q5897625) (← links)
- Simultaneous diagonal flips in plane triangulations (Q5899335) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902522) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Improved product structure for graphs on surfaces (Q6045446) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- The product structure of squaregraphs (Q6143380) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Defective coloring of hypergraphs (Q6201037) (← links)
- The Big-Line-Big-Clique Conjecture is False for Infinite Point Sets (Q6220256) (← links)
- Partitions and Coverings of Trees by Bounded-Degree Subtrees (Q6220269) (← links)
