| 2008 |
|---|
| 51 | EE | Timothy J. Hetherington,
Douglas R. Woodall:
List-colouring the square of a K4-minor-free graph.
Discrete Mathematics 308(18): 4037-4043 (2008) |
| 50 | EE | Douglas R. Woodall:
The average degree of an edge-chromatic critical graph.
Discrete Mathematics 308(5-6): 803-819 (2008) |
| 2007 |
|---|
| 49 | EE | Douglas R. Woodall:
The average degree of an edge-chromatic critical graph II.
Journal of Graph Theory 56(3): 194-218 (2007) |
| 2006 |
|---|
| 48 | EE | Timothy J. Hetherington,
Douglas R. Woodall:
Edge and Total Choosability of Near-Outerplanar Graphs.
Electr. J. Comb. 13(1): (2006) |
| 47 | EE | Douglas R. Woodall:
Total 4-Choosability of Series-Parallel Graphs.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
|---|
| 46 | EE | Douglas R. Woodall:
Preface.
Discrete Mathematics 293(1-3): 1- (2005) |
| 45 | EE | Alexandr V. Kostochka,
Douglas R. Woodall:
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders.
Eur. J. Comb. 26(7): 1119-1138 (2005) |
| 2004 |
|---|
| 44 | EE | Douglas R. Woodall:
Defective choosability of graphs with no edge-plus-independent-set minor.
Journal of Graph Theory 45(1): 51-56 (2004) |
| 2003 |
|---|
| 43 | EE | Dale Peterson,
Douglas R. Woodall:
Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191].
Discrete Mathematics 260(1-3): 323-326 (2003) |
| 42 | EE | Douglas R. Woodall:
Preface.
Discrete Mathematics 266(1-3): 1-2 (2003) |
| 41 | EE | Anton Prowse,
Douglas R. Woodall:
Choosability of Powers of Circuits.
Graphs and Combinatorics 19(1): 137-144 (2003) |
| 2002 |
|---|
| 40 | EE | Douglas R. Woodall:
Tutte polynomial expansions for 2-separable graphs.
Discrete Mathematics 247(1-3): 201-213 (2002) |
| 39 | EE | Andrew M. Robertshaw,
Douglas R. Woodall:
Binding number conditions for matching extension.
Discrete Mathematics 248(1-3): 169-179 (2002) |
| 38 | EE | Douglas R. Woodall:
Defective choosability results for outerplanar and related graphs.
Discrete Mathematics 258(1-3): 215-223 (2002) |
| 37 | EE | Oleg V. Borodin,
Douglas R. Woodall:
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.
SIAM J. Discrete Math. 15(2): 143-154 (2002) |
| 2001 |
|---|
| 36 | EE | Alexandr V. Kostochka,
Douglas R. Woodall:
Density Conditions for Panchromatic Colourings of Hypergraphs.
Combinatorica 21(4): 515-541 (2001) |
| 35 | EE | Douglas R. Woodall:
Preface.
Discrete Mathematics 231(1-3): 1-2 (2001) |
| 34 | EE | Alexandr V. Kostochka,
Douglas R. Woodall:
Sparse sets in the complements of graphs with given girth.
Discrete Mathematics 233(1-3): 163-174 (2001) |
| 33 | EE | Alexandr V. Kostochka,
Douglas R. Woodall:
Choosability conjectures and multicircuits.
Discrete Mathematics 240(1-3): 123-143 (2001) |
| 2000 |
|---|
| 32 | EE | Alexandr V. Kostochka,
Douglas R. Woodall:
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings.
Eur. J. Comb. 21(2): 249-255 (2000) |
| 31 | EE | Andrew M. Robertshaw,
Douglas R. Woodall:
Triangles and Neighbourhoods of Independent Sets in Graphs.
J. Comb. Theory, Ser. B 80(1): 122-129 (2000) |
| 1999 |
|---|
| 30 | EE | Dale Peterson,
Douglas R. Woodall:
Edge-choosability in line-perfect multigraphs.
Discrete Mathematics 202(1-3): 191-199 (1999) |
| 29 | EE | Douglas R. Woodall:
Edge-choosability of multicircuits.
Discrete Mathematics 202(1-3): 271-277 (1999) |
| 28 | EE | Dmitry Fon-Der-Flaass,
Alexandr V. Kostochka,
Douglas R. Woodall:
Transversals in uniform hypergraphs with property (7, 2).
Discrete Mathematics 207(1-3): 277-284 (1999) |
| 1998 |
|---|
| 27 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
On kernel-perfect orientations of line graphs.
Discrete Mathematics 191(1-3): 45-49 (1998) |
| 26 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb. 19(1): 19-24 (1998) |
| 1997 |
|---|
| 25 | EE | John D. Lamb,
Douglas R. Woodall,
Gregory M. Asher:
Bond Graphs I: Acausal Equivalence.
Discrete Applied Mathematics 72(3): 261-293 (1997) |
| 24 | EE | John D. Lamb,
Douglas R. Woodall,
Gregory M. Asher:
Bond Graphs II: Causality and Singularity.
Discrete Applied Mathematics 73(2): 143-173 (1997) |
| 23 | EE | John D. Lamb,
Gregory M. Asher,
Douglas R. Woodall:
Bond Graphs III: Bond Graphs and Electrical Networks.
Discrete Applied Mathematics 73(3): 211-250 (1997) |
| 22 | EE | Douglas R. Woodall:
Monotonicity of Single-seat Preferential Election Rules.
Discrete Applied Mathematics 77(1): 81-98 (1997) |
| 21 | EE | Douglas R. Woodall:
Preface.
Discrete Mathematics 167-168: 1-2 (1997) |
| 20 | EE | Douglas R. Woodall:
The largest real zero of the chromatic polynomial.
Discrete Mathematics 172(1-3): 141-153 (1997) |
| 19 | EE | Douglas R. Woodall:
A Note on Fisher's Inequality.
J. Comb. Theory, Ser. A 77(1): 171-176 (1997) |
| 18 | EE | Oleg V. Borodin,
Alexandr V. Kostochka,
Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory, Ser. B 71(2): 184-204 (1997) |
| 1996 |
|---|
| 17 | EE | Douglas R. Woodall:
An identity involving 3-regular graphs.
Discrete Mathematics 152(1-3): 287-293 (1996) |
| 1995 |
|---|
| 16 | EE | Douglas R. Woodall:
Preface.
Discrete Mathematics 138(1-3): 1-3 (1995) |
| 1992 |
|---|
| 15 | EE | Douglas R. Woodall:
An inequality for chromatic polynomials.
Discrete Mathematics 101(1-3): 327-331 (1992) |
| 14 | EE | Douglas R. Woodall:
A zero-free interval for chromatic polynomials.
Discrete Mathematics 101(1-3): 333-341 (1992) |
| 13 | EE | Douglas R. Woodall:
Local and global proportionality.
Discrete Mathematics 102(3): 315-328 (1992) |
| 12 | EE | Douglas R. Woodall:
Cycle lengths and circuit matroids of graphs.
Discrete Mathematics 105(1-3): 269-273 (1992) |
| 1990 |
|---|
| 11 | EE | Douglas R. Woodall:
A proof of McKee's eulerian-bipartite characterization.
Discrete Mathematics 84(2): 217-220 (1990) |
| 1989 |
|---|
| 10 | EE | Douglas R. Woodall:
Forbidden graphs for degree and neighbourhood conditions.
Discrete Mathematics 75(1-3): 387-404 (1989) |
| 1987 |
|---|
| 9 | EE | Douglas R. Woodall:
An impossibility theorem for electoral systems.
Discrete Mathematics 66(1-2): 209-211 (1987) |
| 1986 |
|---|
| 8 | EE | Douglas R. Woodall:
A note on the cake-division problem.
J. Comb. Theory, Ser. A 42(2): 300-301 (1986) |
| 1982 |
|---|
| 7 | EE | Douglas R. Woodall:
Vector transversals.
J. Comb. Theory, Ser. B 32(2): 189-205 (1982) |
| 6 | EE | Douglas R. Woodall:
Some notes on feinberg's k-independence problem.
J. Comb. Theory, Ser. B 32(3): 350-352 (1982) |
| 1981 |
|---|
| 5 | EE | Béla Bollobás,
D. L. Goldsmith,
Douglas R. Woodall:
Indestructive deletions of edges from graphs.
J. Comb. Theory, Ser. B 30(3): 263-275 (1981) |
| 1978 |
|---|
| 4 | EE | Douglas R. Woodall:
A sufficient condition for hamiltonian circuits.
J. Comb. Theory, Ser. B 25(2): 184-186 (1978) |
| 1977 |
|---|
| 3 | EE | Douglas R. Woodall:
Circuits containing specified edges.
J. Comb. Theory, Ser. B 22(3): 274-278 (1977) |
| 1976 |
|---|
| 2 | EE | Douglas R. Woodall:
A note on a problem of Halin's.
J. Comb. Theory, Ser. B 21(2): 132-134 (1976) |
| 1973 |
|---|
| 1 | | Douglas R. Woodall:
Distances Realized by Sets Covering the Plane.
J. Comb. Theory, Ser. A 14(2): 187-200 (1973) |
