The following pages link to David R. Wood (Q259169):
Displaying 50 items.
- Extremal Graph Theory for Metric Dimension and Diameter (Q3503491) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- (Q3558604) (← links)
- (Q3575458) (← links)
- (Q3575470) (← links)
- (Q3576658) (← links)
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor (Q3595473) (← links)
- Improved upper bounds on the crossing number (Q3602937) (← links)
- (Q3625873) (← links)
- (Q4415269) (← links)
- (Q4422261) (← links)
- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings (Q4435327) (← links)
- (Q4472316) (← links)
- (Q4472318) (← links)
- (Q4472320) (← links)
- (Q4501708) (← links)
- Corrigendum: Orthogonal Tree Decompositions of Graphs (Q4562318) (← links)
- Edge-Maximal Graphs on Surfaces (Q4584324) (← links)
- Improper colourings inspired by Hadwiger's conjecture (Q4584332) (← links)
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference (Q4595652) (← links)
- Thickness and Antithickness of Graphs (Q4626298) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Transversals in Latin Arrays with Many Distinct Symbols (Q4642158) (← links)
- (Q4657578) (← links)
- (Q4667610) (← links)
- (Q4667621) (← links)
- (Q4667626) (← links)
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing (Q4679078) (← links)
- Anagram-Free Colorings of Graph Subdivisions (Q4684464) (← links)
- (Q4780504) (← links)
- (Q4796197) (← links)
- Degree constrained book embeddings (Q4806603) (← links)
- (Q4823519) (← links)
- An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains (Q4899045) (← links)
- The Chromatic Number of the Convex Segment Disjointness Graph (Q4899266) (← links)
- Separation dimension and degree (Q4958696) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Inducibility and universality for trees (Q5051466) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- A variant of the Erdős‐Sós conjecture (Q5110682) (← links)
- Planar graphs have bounded nonrepetitive chromatic number (Q5126756) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Planar Graphs Have Bounded Queue-Number (Q5133977) (← links)
- Graph Drawing (Q5193181) (← links)
- A Golden Ratio Inequality for Vertex Degrees of Graphs (Q5197501) (← links)
- Better bounds for poset dimension and boxicity (Q5217895) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor (Q5229534) (← links)
- Treewidth of the Line Graph of a Complete Graph (Q5251200) (← links)
- Circumference and Pathwidth of Highly Connected Graphs (Q5265331) (← links)
