Distances Realized by Sets Covering the Plane. - Douglas R. Woodall (J. Comb. Theory A, 1973)

A note on a problem of Halin's. - Douglas R. Woodall (J. Comb. Theory B, 1976)

A note on rank functions and integer programming. - Douglas R. Woodall (Discret. Math., 1977)

Circuits containing specified edges. - Douglas R. Woodall (J. Comb. Theory B, 1977)

A sufficient condition for hamiltonian circuits. - Douglas R. Woodall (J. Comb. Theory B, 1978)

Indestructive deletions of edges from graphs. - Béla Bollobás; Donald L. Goldsmith; Douglas R. Woodall (J. Comb. Theory B, 1981)

Vector transversals. - Douglas R. Woodall (J. Comb. Theory B, 1982)

Some notes on feinberg's k-independence problem. - Douglas R. Woodall (J. Comb. Theory B, 1982)

A note on the cake-division problem. - Douglas R. Woodall (J. Comb. Theory A, 1986)

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. - Lenore J. Cowen; Robert Cowen; Douglas R. Woodall (J. Graph Theory, 1986)

An impossibility theorem for electoral systems. - Douglas R. Woodall (Discret. Math., 1987)

Subcontraction-equivalence and Hadwiger's conjecture. - Douglas R. Woodall (J. Graph Theory, 1987)

Forbidden graphs for degree and neighbourhood conditions. - Douglas R. Woodall (Discret. Math., 1989)

A proof of McKee's eulerian-bipartite characterization. - Douglas R. Woodall (Discret. Math., 1990)

Maximal matchings in graphs with large neighborhoods of independent vertices. - I. Rinsma; C. H. C. Little; Douglas R. Woodall (J. Graph Theory, 1990)

An inequality for chromatic polynomials. - Douglas R. Woodall (Discret. Math., 1992)

A zero-free interval for chromatic polynomials. - Douglas R. Woodall (Discret. Math., 1992)

Local and global proportionality. - Douglas R. Woodall (Discret. Math., 1992)

Cycle lengths and circuit matroids of graphs. - Douglas R. Woodall (Discret. Math., 1992)

Chromatic polynomials, polygon trees, and outerplanar graphs. - C. D. Wakelin; Douglas R. Woodall (J. Graph Theory, 1992)

A short proof of a theorem of dirac's about hadwiger's conjecture. - Douglas R. Woodall (J. Graph Theory, 1992)

Cyclic-order graphs and Zarankiewicz's crossing-number conjecture. - Douglas R. Woodall (J. Graph Theory, 1993)

An identity involving 3-regular graphs. - Douglas R. Woodall (Discret. Math., 1996)

Bond Graphs III: Bond Graphs and Electrical Networks. - John D. Lamb; Gregory M. Asher; Douglas R. Woodall (Discret. Appl. Math., 1997)

Bond Graphs I: Acausal Equivalence. - John D. Lamb; Douglas R. Woodall; Gregory M. Asher (Discret. Appl. Math., 1997)

Bond Graphs II: Causality and Singularity. - John D. Lamb; Douglas R. Woodall; Gregory M. Asher (Discret. Appl. Math., 1997)

Monotonicity of Single-seat Preferential Election Rules. - Douglas R. Woodall (Discret. Appl. Math., 1997)

The largest real zero of the chromatic polynomial. - Douglas R. Woodall (Discret. Math., 1997)

List Edge and List Total Colourings of Multigraphs. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (J. Comb. Theory B, 1997)

A Note on Fisher's Inequality. - Douglas R. Woodall (J. Comb. Theory A, 1997)

Total colorings of planar graphs with large maximum degree. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (J. Graph Theory, 1997)

On kernel-perfect orientations of line graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 1998)

Short cycles of low weight in normal plane maps with minimum degree 5. - Oleg V. Borodin; Douglas R. Woodall (Discuss. Math. Graph Theory, 1998)

Total Colourings of Planar Graphs with Large Girth. - Oleg V. Borodin; Alexandr V. Kostochka; Douglas R. Woodall (Eur. J. Comb., 1998)

Transversals in uniform hypergraphs with property (7, 2). - Dmitry Fon-Der-Flaass; Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 1999)

Edge-choosability in line-perfect multigraphs. - Dale Peterson; Douglas R. Woodall (Discret. Math., 1999)

Edge-choosability of multicircuits. - Douglas R. Woodall (Discret. Math., 1999)

Cyclic Degrees of 3-Polytopes. - Oleg V. Borodin; Douglas R. Woodall (Graphs Comb., 1999)

Cycle Orders. - Peter C. Fishburn; Douglas R. Woodall (Order, 1999)

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings. - Alexandr V. Kostochka; Douglas R. Woodall (Eur. J. Comb., 2000)

Triangles and Neighbourhoods of Independent Sets in Graphs. - Andrew M. Robertshaw; Douglas R. Woodall (J. Comb. Theory B, 2000)

Density Conditions for Panchromatic Colourings of Hypergraphs. - Alexandr V. Kostochka; Douglas R. Woodall (Comb., 2001)

Choosability conjectures and multicircuits. - Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 2001)

Sparse sets in the complements of graphs with given girth. - Alexandr V. Kostochka; Douglas R. Woodall (Discret. Math., 2001)

Binding number conditions for matching extension. - Andrew M. Robertshaw; Douglas R. Woodall (Discret. Math., 2002)

Defective choosability results for outerplanar and related graphs. - Douglas R. Woodall (Discret. Math., 2002)

Tutte polynomial expansions for 2-separable graphs. - Douglas R. Woodall (Discret. Math., 2002)

Total choosability of multicircuits I. - Alexandr V. Kostochka; Douglas R. Woodall (J. Graph Theory, 2002)

Total choosability of multicircuits II. - Alexandr V. Kostochka; Douglas R. Woodall (J. Graph Theory, 2002)

Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. - Oleg V. Borodin; Douglas R. Woodall (SIAM J. Discret. Math., 2002)

Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191]. - Dale Peterson; Douglas R. Woodall (Discret. Math., 2003)

Preface. - Douglas R. Woodall (Discret. Math., 2003)

Choosability of Powers of Circuits. - Anton Prowse; Douglas R. Woodall (Graphs Comb., 2003)

Defective choosability of graphs with no edge-plus-independent-set minor. - Douglas R. Woodall (J. Graph Theory, 2004)

Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. - Alexandr V. Kostochka; Douglas R. Woodall (Eur. J. Comb., 2005)

Edge and Total Choosability of Near-Outerplanar Graphs. - Timothy J. Hetherington; Douglas R. Woodall (Electron. J. Comb., 2006)

Total 4-Choosability of Series-Parallel Graphs. - Douglas R. Woodall (Electron. J. Comb., 2006)

Some totally 4-choosable multigraphs. - Douglas R. Woodall (Discuss. Math. Graph Theory, 2007)

The average degree of an edge-chromatic critical graph II. - Douglas R. Woodall (J. Graph Theory, 2007)

List-colouring the square of a K4-minor-free graph. - Timothy J. Hetherington; Douglas R. Woodall (Discret. Math., 2008)

The average degree of an edge-chromatic critical graph. - Douglas R. Woodall (Discret. Math., 2008)

Defective Choosability of Graphs without Small Minors. - Rupert G. Wood; Douglas R. Woodall (Electron. J. Comb., 2009)

A Brooks-type bound for squares of K4-minor-free graphs. - Alexandr V. Kostochka; Lale Özkahya; Douglas R. Woodall (Discret. Math., 2009)

The average degree of a multigraph critical with respect to edge or total choosability. - Douglas R. Woodall (Discret. Math., 2010)

List-colouring the square of an outerplanar graph. - Timothy J. Hetherington; Douglas R. Woodall (Ars Comb., 2011)

Ohba's conjecture for graphs with independence number five. - Alexandr V. Kostochka; Michael Stiebitz; Douglas R. Woodall (Discret. Math., 2011)

Defective choosability of graphs in surfaces. - Douglas R. Woodall (Discuss. Math. Graph Theory, 2011)

The independence number of an edge-chromatic critical graph. - Douglas R. Woodall (J. Graph Theory, 2011)

Colourfully panconnected subgraphs II. - Douglas R. Woodall (Ars Comb., 2012)

Toughness and binding number. - Douglas Bauer; Nathan Kahl; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Discret. Appl. Math., 2014)

Light C4 and C5 in 3-polytopes with minimum degree 5. - Oleg V. Borodin; Anna O. Ivanova; Douglas R. Woodall (Discret. Math., 2014)

Best monotone degree conditions for binding number and cycle structure. - Douglas Bauer; Aori Nevo; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Discret. Appl. Math., 2015)

Towards size reconstruction from fewer cards. - Douglas R. Woodall (Discret. Math., 2015)

Best Monotone Degree Conditions for Graph Properties: A Survey. - Douglas Bauer; Hajo Broersma; Jan van den Heuvel; Nathan Kahl; Aori Nevo; Edward F. Schmeichel; Douglas R. Woodall; Michael Yatauro (Graphs Comb., 2015)

The average degree of a subcubic edge?chromatic critical graph. - Douglas R. Woodall (J. Graph Theory, 2019)

Erratum: The average degree of an edge-chromatic critical graph II. - Douglas R. Woodall (J. Graph Theory, 2019)