The following pages link to Douglas R. Woodall (Q214988):
Displaying 50 items.
- An exchange theorem for bases of matroids (Q2265433) (← links)
- Defective choosability of graphs without small minors (Q2380248) (← links)
- Toughness and binding number (Q2448921) (← links)
- The average degree of an edge-chromatic critical graph (Q2470447) (← links)
- Towards size reconstruction from fewer cards (Q2515598) (← links)
- A market problem (Q2532766) (← links)
- Distances realized by sets covering the plane (Q2557037) (← links)
- The binding number of a graph, and its Anderson number (Q2561611) (← links)
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders (Q2567286) (← links)
- List colourings of graphs (Q2741180) (← links)
- Cyclic colorings of 3-polytopes with large maximum face size (Q2784508) (← links)
- Colourfully panconnected subgraphs. II. (Q2846652) (← links)
- List-colouring the square of an outerplanar graph. (Q2918556) (← links)
- (Q3035307) (← links)
- The independence number of an edge-chromatic critical graph (Q3081307) (← links)
- Defective choosability of graphs in surfaces (Q3092679) (← links)
- Erratum: The average degree of an edge‐chromatic critical graph II (Q3299218) (← links)
- Reciprocal auto-Backlund transformations (Q3326144) (← links)
- Some totally 4-choosable multigraphs (Q3504798) (← links)
- (Q3514294) (← links)
- (Q3567544) (← links)
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS (Q3781142) (← links)
- <i>k</i> -Factors and Neighbourhoods of Independent Sets in Graphs (Q3808124) (← links)
- Subcontraction-equivalence and Hadwiger's conjecture (Q3824327) (← links)
- Acyclic Colourings of Planar Graphs with Large Girth (Q3839894) (← links)
- (Q3869374) (← links)
- (Q3870927) (← links)
- A short proof of a theorem of dirac's about hadwiger's conjecture (Q3990876) (← links)
- (Q4000794) (← links)
- Chromatic polynomials, polygon trees, and outerplanar graphs (Q4020704) (← links)
- (Q4047558) (← links)
- The Induction of Matroids by Graphs<sup>†</sup> (Q4058976) (← links)
- (Q4083436) (← links)
- Maximal circuits of graphs. I (Q4103567) (← links)
- A theorem on cubes (Q4119211) (← links)
- (Q4128619) (← links)
- (Q4134010) (← links)
- (Q4172066) (← links)
- Short cycles of low weight in normal plane maps with minimum degree 5 (Q4254299) (← links)
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture (Q4285587) (← links)
- (Q4309123) (← links)
- (Q4326213) (← links)
- Total colorings of planar graphs with large maximum degree (Q4355071) (← links)
- (Q4386291) (← links)
- Defective choosability of graphs with no edge-plus-independent-set minor (Q4446887) (← links)
- Total choosability of multicircuits I (Q4537554) (← links)
- Total choosability of multicircuits II (Q4537555) (← links)
- Maximal matchings in graphs with large neighborhoods of independent vertices (Q4713005) (← links)
- The Bay Restaurant--A Linear Storage Problem (Q4773480) (← links)
- (Q4846547) (← links)
