The following pages link to David R. Wood (Q259169):
Displayed 50 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- On the maximum order of graphs embedded in surfaces (Q273165) (← links)
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- Progress on Dirac's conjecture (Q405200) (← links)
- Nordhaus-Gaddum for treewidth (Q412239) (← links)
- Clique minors in Cartesian products of graphs (Q416762) (← links)
- Small minors in dense graphs (Q427808) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Graph minors and minimum degree (Q612934) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- Disproof of the list Hadwiger conjecture (Q665753) (← links)
- Grid drawings of \(k\)-colourable graphs (Q706720) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Hadwiger's conjecture for 3-arc graphs (Q727197) (← links)
- No-three-in-line-in-3D (Q879952) (← links)
- Compatible geometric matchings (Q924079) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Irreducible triangulations are small (Q974471) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- The minor crossing number of graphs with an excluded minor (Q1010709) (← links)
- Notes on nonrepetitive graph colouring (Q1010826) (← links)
- Distinct distances in graph drawings (Q1010836) (← links)
- On tree-partition-width (Q1024321) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Bounded degree acyclic decompositions of digraphs. (Q1426101) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- The extremal function for Petersen minors (Q1748273) (← links)
- Defective and clustered graph colouring (Q1751289) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Light edges in degree-constrained graphs (Q1827725) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- Dimension-exchange algorithms for token distribution on tree-connected architectures (Q1881301) (← links)
- Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout (Q1889862) (← links)
- Token graphs (Q1926040) (← links)
- Complete graph minors and the graph minor structure theorem (Q1932472) (← links)
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours (Q1953438) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Notes on graph product structure theory (Q2058955) (← links)