The following pages link to David R. Wood (Q259169):
Displaying 50 items.
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Nonrepetitive graph colouring (Q2122918) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- An improved planar graph product structure theorem (Q2152790) (← links)
- A lower bound on the average degree forcing a minor (Q2189420) (← links)
- Clustered colouring in minor-closed classes (Q2300163) (← links)
- Defective colouring of graphs excluding a subgraph or minor (Q2322507) (← links)
- Graph treewidth and geometric thickness parameters (Q2369933) (← links)
- Planar decompositions and the crossing number of graphs with an excluded minor (Q2373925) (← links)
- Extremal graph theory for metric dimension and diameter (Q2380462) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- General position subsets and independent hyperplanes in \(d\)-space (Q2397235) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- Three-dimensional orthogonal graph drawing with optimal volume (Q2492635) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Drawing a graph in a hypercube (Q2500992) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- On the chromatic number of the visibility graph of a set of points in the plane (Q2572584) (← links)
- Bounded-degree graphs have arbitrarily large geometric thickness (Q2583678) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Thoughts on Barnette's conjecture (Q2800788) (← links)
- Blocking Colored Point Sets (Q2849797) (← links)
- On multiplicative Sidon sets (Q2855604) (← links)
- On the Upward Planarity of Mixed Plane Graphs (Q2867638) (← links)
- A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265) (← links)
- Genus, Treewidth, and Local Crossing Number (Q2959745) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- On visibility and blockers (Q2968067) (← links)
- Colouring the triangles determined by a point set (Q2968087) (← links)
- Which point sets admit a $k$-angulation? (Q2968108) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Hadwiger's Conjecture for ℓ‐Link Graphs (Q2978185) (← links)
- Thomassen's Choosability Argument Revisited (Q3013152) (← links)
- (Q3043700) (← links)
- (Q3043732) (← links)
- (Q3043733) (← links)
- $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
- Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms (Q3148230) (← links)
- Three-Dimensional 1-Bend Graph Drawings (Q3378502) (← links)
- Vertex partitions of chordal graphs (Q3419709) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets (Q3439562) (← links)
- Empty Pentagons in Point Sets with Collinearities (Q3453574) (← links)
- Cycles of Given Size in a Dense Graph (Q3455245) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
