Douglas R. Woodall

Publication Activity (10 Years)

Years Active: 1973-2019
Publications (10 Years): 5

Top Topics

Small World Networks

Phase Transition

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Douglas R. Woodall
The average degree of a subcubic edge?chromatic critical graph. J. Graph Theory 91 (2) (2019)
Douglas R. Woodall
Erratum: The average degree of an edge-chromatic critical graph II. J. Graph Theory 92 (4) (2019)
Douglas Bauer, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. 195 (2015)
Douglas R. Woodall
Towards size reconstruction from fewer cards. Discret. Math. 338 (12) (2015)
Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31 (1) (2015)
Oleg V. Borodin, Anna O. Ivanova, Douglas R. Woodall
in 3-polytopes with minimum degree 5. Discret. Math. 334 (2014)
Douglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Toughness and binding number. Discret. Appl. Math. 165 (2014)
Douglas R. Woodall
Colourfully panconnected subgraphs II. Ars Comb. 106 (2012)
Douglas R. Woodall
Defective choosability of graphs in surfaces. Discuss. Math. Graph Theory 31 (3) (2011)
Douglas R. Woodall
The independence number of an edge-chromatic critical graph. J. Graph Theory 66 (2) (2011)
Timothy J. Hetherington, Douglas R. Woodall
List-colouring the square of an outerplanar graph. Ars Comb. 101 (2011)
Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall
Ohba's conjecture for graphs with independence number five. Discret. Math. 311 (12) (2011)
Douglas R. Woodall
The average degree of a multigraph critical with respect to edge or total choosability. Discret. Math. 310 (6-7) (2010)
Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall
-minor-free graphs. Discret. Math. 309 (23-24) (2009)
Rupert G. Wood, Douglas R. Woodall
Defective Choosability of Graphs without Small Minors. Electron. J. Comb. 16 (1) (2009)
Douglas R. Woodall
The average degree of an edge-chromatic critical graph. Discret. Math. 308 (5-6) (2008)
Timothy J. Hetherington, Douglas R. Woodall
-minor-free graph. Discret. Math. 308 (18) (2008)
Douglas R. Woodall
Some totally 4-choosable multigraphs. Discuss. Math. Graph Theory 27 (3) (2007)
Douglas R. Woodall
The average degree of an edge-chromatic critical graph II. J. Graph Theory 56 (3) (2007)
Douglas R. Woodall
Total 4-Choosability of Series-Parallel Graphs. Electron. J. Comb. 13 (1) (2006)
Timothy J. Hetherington, Douglas R. Woodall
Edge and Total Choosability of Near-Outerplanar Graphs. Electron. J. Comb. 13 (1) (2006)
Douglas R. Woodall
Preface. Discret. Math. 293 (1-3) (2005)
Alexandr V. Kostochka, Douglas R. Woodall
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. Eur. J. Comb. 26 (7) (2005)
Douglas R. Woodall
Defective choosability of graphs with no edge-plus-independent-set minor. J. Graph Theory 45 (1) (2004)
Anton Prowse, Douglas R. Woodall
Choosability of Powers of Circuits. Graphs Comb. 19 (1) (2003)
Dale Peterson, Douglas R. Woodall
Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191]. Discret. Math. 260 (1-3) (2003)
Douglas R. Woodall
Preface. Discret. Math. 266 (1-3) (2003)
Alexandr V. Kostochka, Douglas R. Woodall
Total choosability of multicircuits II. J. Graph Theory 40 (1) (2002)
Alexandr V. Kostochka, Douglas R. Woodall
Total choosability of multicircuits I. J. Graph Theory 40 (1) (2002)
Andrew M. Robertshaw, Douglas R. Woodall
Binding number conditions for matching extension. Discret. Math. 248 (1-3) (2002)
Oleg V. Borodin, Douglas R. Woodall
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. SIAM J. Discret. Math. 15 (2) (2002)
Douglas R. Woodall
Tutte polynomial expansions for 2-separable graphs. Discret. Math. 247 (1-3) (2002)
Douglas R. Woodall
Defective choosability results for outerplanar and related graphs. Discret. Math. 258 (1-3) (2002)
Alexandr V. Kostochka, Douglas R. Woodall
Density Conditions for Panchromatic Colourings of Hypergraphs. Comb. 21 (4) (2001)
Douglas R. Woodall
Preface. Discret. Math. 231 (1-3) (2001)
Alexandr V. Kostochka, Douglas R. Woodall
Choosability conjectures and multicircuits. Discret. Math. 240 (1-3) (2001)
Alexandr V. Kostochka, Douglas R. Woodall
Sparse sets in the complements of graphs with given girth. Discret. Math. 233 (1-3) (2001)
Andrew M. Robertshaw, Douglas R. Woodall
Triangles and Neighbourhoods of Independent Sets in Graphs. J. Comb. Theory, Ser. B 80 (1) (2000)
Alexandr V. Kostochka, Douglas R. Woodall
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings. Eur. J. Comb. 21 (2) (2000)
Douglas R. Woodall
Edge-choosability of multicircuits. Discret. Math. 202 (1-3) (1999)
Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall
Transversals in uniform hypergraphs with property (7, 2). Discret. Math. 207 (1-3) (1999)
Dale Peterson, Douglas R. Woodall
Edge-choosability in line-perfect multigraphs. Discret. Math. 202 (1-3) (1999)
Oleg V. Borodin, Douglas R. Woodall
Cyclic Degrees of 3-Polytopes. Graphs Comb. 15 (3) (1999)
Peter C. Fishburn, Douglas R. Woodall
Cycle Orders. Order 16 (2) (1999)
Oleg V. Borodin, Douglas R. Woodall
Short cycles of low weight in normal plane maps with minimum degree 5. Discuss. Math. Graph Theory 18 (2) (1998)
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
On kernel-perfect orientations of line graphs. Discret. Math. 191 (1-3) (1998)
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
Total Colourings of Planar Graphs with Large Girth. Eur. J. Comb. 19 (1) (1998)
Douglas R. Woodall
Preface. Discret. Math. (1997)
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
Total colorings of planar graphs with large maximum degree. J. Graph Theory 26 (1) (1997)
Douglas R. Woodall
The largest real zero of the chromatic polynomial. Discret. Math. 172 (1-3) (1997)
Douglas R. Woodall
Monotonicity of Single-seat Preferential Election Rules. Discret. Appl. Math. 77 (1) (1997)
John D. Lamb, Gregory M. Asher, Douglas R. Woodall
Bond Graphs III: Bond Graphs and Electrical Networks. Discret. Appl. Math. 73 (3) (1997)
John D. Lamb, Douglas R. Woodall, Gregory M. Asher
Bond Graphs I: Acausal Equivalence. Discret. Appl. Math. 72 (3) (1997)
Douglas R. Woodall
A Note on Fisher's Inequality. J. Comb. Theory, Ser. A 77 (1) (1997)
John D. Lamb, Douglas R. Woodall, Gregory M. Asher
Bond Graphs II: Causality and Singularity. Discret. Appl. Math. 73 (2) (1997)
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
List Edge and List Total Colourings of Multigraphs. J. Comb. Theory, Ser. B 71 (2) (1997)
Douglas R. Woodall
An identity involving 3-regular graphs. Discret. Math. 152 (1-3) (1996)
Douglas R. Woodall
Preface. Discret. Math. 138 (1-3) (1995)
Douglas R. Woodall
Cyclic-order graphs and Zarankiewicz's crossing-number conjecture. J. Graph Theory 17 (6) (1993)
Douglas R. Woodall
Local and global proportionality. Discret. Math. 102 (3) (1992)
Douglas R. Woodall
An inequality for chromatic polynomials. Discret. Math. 101 (1-3) (1992)
Douglas R. Woodall
A short proof of a theorem of dirac's about hadwiger's conjecture. J. Graph Theory 16 (1) (1992)
Douglas R. Woodall
Cycle lengths and circuit matroids of graphs. Discret. Math. 105 (1-3) (1992)
Douglas R. Woodall
A zero-free interval for chromatic polynomials. Discret. Math. 101 (1-3) (1992)
C. D. Wakelin, Douglas R. Woodall
Chromatic polynomials, polygon trees, and outerplanar graphs. J. Graph Theory 16 (5) (1992)
Douglas R. Woodall
A proof of McKee's eulerian-bipartite characterization. Discret. Math. 84 (2) (1990)
I. Rinsma, C. H. C. Little, Douglas R. Woodall
Maximal matchings in graphs with large neighborhoods of independent vertices. J. Graph Theory 14 (2) (1990)
Douglas R. Woodall
Forbidden graphs for degree and neighbourhood conditions. Discret. Math. 75 (1-3) (1989)
Douglas R. Woodall
An impossibility theorem for electoral systems. Discret. Math. 66 (1-2) (1987)
Douglas R. Woodall
Subcontraction-equivalence and Hadwiger's conjecture. J. Graph Theory 11 (2) (1987)
Lenore J. Cowen, Robert Cowen, Douglas R. Woodall
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Theory 10 (2) (1986)
Douglas R. Woodall
A note on the cake-division problem. J. Comb. Theory, Ser. A 42 (2) (1986)
Douglas R. Woodall
-independence problem. J. Comb. Theory, Ser. B 32 (3) (1982)
Douglas R. Woodall
Vector transversals. J. Comb. Theory, Ser. B 32 (2) (1982)
Béla Bollobás, Donald L. Goldsmith, Douglas R. Woodall
Indestructive deletions of edges from graphs. J. Comb. Theory, Ser. B 30 (3) (1981)
Douglas R. Woodall
A sufficient condition for hamiltonian circuits. J. Comb. Theory, Ser. B 25 (2) (1978)
Douglas R. Woodall
Circuits containing specified edges. J. Comb. Theory, Ser. B 22 (3) (1977)
Douglas R. Woodall
A note on rank functions and integer programming. Discret. Math. 17 (2) (1977)
Douglas R. Woodall
A note on a problem of Halin's. J. Comb. Theory, Ser. B 21 (2) (1976)
Douglas R. Woodall
Distances Realized by Sets Covering the Plane. J. Comb. Theory, Ser. A 14 (2) (1973)