Douglas R. Woodall

Orcid: 0000-0002-1979-8855

  • University of Nottingham, UK

According to our database1, Douglas R. Woodall authored at least 76 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Erratum: The average degree of an edge-chromatic critical graph II.
J. Graph Theory, 2019

The average degree of a subcubic edge?chromatic critical graph.
J. Graph Theory, 2019

Best Monotone Degree Conditions for Graph Properties: A Survey.
Graphs Comb., 2015

Towards size reconstruction from fewer cards.
Discret. Math., 2015

Best monotone degree conditions for binding number and cycle structure.
Discret. Appl. Math., 2015

Light C<sub>4</sub> and C<sub>5</sub> in 3-polytopes with minimum degree 5.
Discret. Math., 2014

Toughness and binding number.
Discret. Appl. Math., 2014

Colourfully panconnected subgraphs II.
Ars Comb., 2012

The independence number of an edge-chromatic critical graph.
J. Graph Theory, 2011

Defective choosability of graphs in surfaces.
Discuss. Math. Graph Theory, 2011

Ohba's conjecture for graphs with independence number five.
Discret. Math., 2011

List-colouring the square of an outerplanar graph.
Ars Comb., 2011

The average degree of a multigraph critical with respect to edge or total choosability.
Discret. Math., 2010

A Brooks-type bound for squares of K<sub>4</sub>-minor-free graphs.
Discret. Math., 2009

Defective Choosability of Graphs without Small Minors.
Electron. J. Comb., 2009

The average degree of an edge-chromatic critical graph.
Discret. Math., 2008

List-colouring the square of a K<sub>4</sub>-minor-free graph.
Discret. Math., 2008

The average degree of an edge-chromatic critical graph II.
J. Graph Theory, 2007

Some totally 4-choosable multigraphs.
Discuss. Math. Graph Theory, 2007

Total 4-Choosability of Series-Parallel Graphs.
Electron. J. Comb., 2006

Edge and Total Choosability of Near-Outerplanar Graphs.
Electron. J. Comb., 2006

Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders.
Eur. J. Comb., 2005

Defective choosability of graphs with no edge-plus-independent-set minor.
J. Graph Theory, 2004

Choosability of Powers of Circuits.
Graphs Comb., 2003

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

Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.
SIAM J. Discret. Math., 2002

Total choosability of multicircuits II.
J. Graph Theory, 2002

Total choosability of multicircuits I.
J. Graph Theory, 2002

Tutte polynomial expansions for 2-separable graphs.
Discret. Math., 2002

Defective choosability results for outerplanar and related graphs.
Discret. Math., 2002

Binding number conditions for matching extension.
Discret. Math., 2002

Sparse sets in the complements of graphs with given girth.
Discret. Math., 2001

Choosability conjectures and multicircuits.
Discret. Math., 2001

Density Conditions for Panchromatic Colourings of Hypergraphs.
Comb., 2001

Triangles and Neighbourhoods of Independent Sets in Graphs.
J. Comb. Theory B, 2000

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings.
Eur. J. Comb., 2000

Cycle Orders.
Order, 1999

Cyclic Degrees of 3-Polytopes.
Graphs Comb., 1999

Edge-choosability of multicircuits.
Discret. Math., 1999

Edge-choosability in line-perfect multigraphs.
Discret. Math., 1999

Transversals in uniform hypergraphs with property (7, 2).
Discret. Math., 1999

Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb., 1998

Short cycles of low weight in normal plane maps with minimum degree 5.
Discuss. Math. Graph Theory, 1998

On kernel-perfect orientations of line graphs.
Discret. Math., 1998

Total colorings of planar graphs with large maximum degree.
J. Graph Theory, 1997

A Note on Fisher's Inequality.
J. Comb. Theory A, 1997

List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory B, 1997

Discret. Math., 1997

The largest real zero of the chromatic polynomial.
Discret. Math., 1997

Monotonicity of Single-seat Preferential Election Rules.
Discret. Appl. Math., 1997

Bond Graphs II: Causality and Singularity.
Discret. Appl. Math., 1997

Bond Graphs I: Acausal Equivalence.
Discret. Appl. Math., 1997

Bond Graphs III: Bond Graphs and Electrical Networks.
Discret. Appl. Math., 1997

An identity involving 3-regular graphs.
Discret. Math., 1996

Cyclic-order graphs and Zarankiewicz's crossing-number conjecture.
J. Graph Theory, 1993

A short proof of a theorem of dirac's about hadwiger's conjecture.
J. Graph Theory, 1992

Chromatic polynomials, polygon trees, and outerplanar graphs.
J. Graph Theory, 1992

Cycle lengths and circuit matroids of graphs.
Discret. Math., 1992

Local and global proportionality.
Discret. Math., 1992

A zero-free interval for chromatic polynomials.
Discret. Math., 1992

An inequality for chromatic polynomials.
Discret. Math., 1992

Maximal matchings in graphs with large neighborhoods of independent vertices.
J. Graph Theory, 1990

A proof of McKee's eulerian-bipartite characterization.
Discret. Math., 1990

Forbidden graphs for degree and neighbourhood conditions.
Discret. Math., 1989

Subcontraction-equivalence and Hadwiger's conjecture.
J. Graph Theory, 1987

An impossibility theorem for electoral systems.
Discret. Math., 1987

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency.
J. Graph Theory, 1986

A note on the cake-division problem.
J. Comb. Theory A, 1986

Some notes on feinberg's <i>k</i>-independence problem.
J. Comb. Theory B, 1982

Vector transversals.
J. Comb. Theory B, 1982

Indestructive deletions of edges from graphs.
J. Comb. Theory B, 1981

A sufficient condition for hamiltonian circuits.
J. Comb. Theory B, 1978

Circuits containing specified edges.
J. Comb. Theory B, 1977

A note on rank functions and integer programming.
Discret. Math., 1977

A note on a problem of Halin's.
J. Comb. Theory B, 1976

Distances Realized by Sets Covering the Plane.
J. Comb. Theory A, 1973