Full list of papers by D. R. Woodall (latest at end)

Papers related to teaching

  1. Inductio ad absurdum?, The Mathematical Gazette 59 (1975), 64–70, and (in Czech) Pokroky Matematiky Fyziky a Astronomie 21 (1976), 17–22.
  2. Teaching through discussion groups, The Mathematical Gazette 60 (1976), 194–198.
  3. Finite sums, matrices and induction, The Mathematical Gazette 65 (1981), 92–103.
School, student and popular articles, and working papers
  1. The Marlborough College Eclipse Expedition, J. Brit. Astron. Assoc. 71 (1961), 369–372, and (with minor variations) Report of the Marlborough College Natural History Society 101 (1961), 12–16.
  2. Spectrum Analysis at Marlborough College, J. Brit. Astron. Assoc. 72 (1962), 273–276.
  3. Parallel Curves, Eureka 28 (1965), 12–18.
  4. The paradox of the surprise examination, Eureka 30 (1967), 31–32.
  5. Impossible objects, Eureka 31 (1968), 23–27.
  6. A criticism of the Football League Eigenvector, Eureka 34 (1971), 27–28.
  7. On badly behaved fish fingers, Eureka 34 (1971), 37–39, and (with minor variations) The Mathematical Intelligencer 2 (1980), 188–189.
  8. The four-colour conjecture is proved, Manifold 19 (1977), 14–22; reprinted as "The 4-colour theorem" in Seven Years of Manifold 1968–1980 (I. Stewart and J. Jaworski, eds, Shiva Publishing Ltd, 1981), 69–75.
  9. The four-colour theorem, Bull. Inst. Math. Appl. 14 (1978), 245–249.
  10. The four-colour theorem, Mathematical Spectrum 11 (1979), 69–75; reprinted in A Mathematical Spectrum Miscellany (Applied Probability Trust, 2000), 82–88.
  11. On storing pieces of string, The Mathematical Intelligencer 2 (1980), 155–156.
  12. Computer counting in STV elections, Representation 23 (1983), 4–6; reprinted (with correction) in Voting matters 1 (1994), 11–12.
  13. How proportional is proportional representation?, The Mathematical Intelligencer 8 (1986), 36–46.
  14. Two three-dimensional problems, Geombinatorics 1 (4) (1992), 18–20.
  15. Properties of preferential election rules, Voting matters 3 (1994), 8–15.
  16. Monotonicity—an in-depth study of one example, Voting matters 4 (1995), 5–7.
  17. Monotonicity and single-seat election rules, Voting matters 6 (1996), 9–14.
  18. QPQ, a quota-preferential STV-like election rule, Voting matters 17 (2003), 1–7.
Research papers
  1. [Some results in combinatorial mathematics, Ph.D. Thesis, University of Nottingham, 1969.]
  2. D. R. Woodall, The λ–μ problem, J. London Math. Soc. (2) 1 (1969), 509–519.    [abstract]
  3. D. R. Woodall, A market problem, J. Combin. Theory Ser. B 10 (1971), 275–287.    [abstract]
  4. D. R. Woodall, Square λ-linked designs, Proc. London Math. Soc. (3) 20 (1970), 669–687.    [abstract]
  5. D. R. Woodall, Square λ-linked designs: a survey, in D. J. A. Welsh, ed., Combinatorial Mathematics and its Applications, Proc. 1969 Oxford Combinatorial Conference (Academic Press, London and New York, 1971), 349–355.    [No abstract.]
  6. D. R. Woodall, Thrackles and deadlock, in D. J. A. Welsh, ed., Combinatorial Mathematics and its Applications, Proc. 1969 Oxford Combinatorial Conference (Academic Press, London and New York, 1971), 335–347.    [abstract]
  7. D. R. Woodall, Distances realized by sets covering the plane, J. Combin. Theory Ser. A 14 (1973), 187–200.    [abstract]
  8. D. R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. (3) 24 (1972), 739–755.    [abstract]
  9. T. H. Jackson, J. H. Williamson and D. R. Woodall, Difference-covers that are not k-sum-covers I, Proc. Camb. Phil. Soc. 72 (1972), 425–438.    [abstract]
  10. D. R. Woodall, The Bay Restaurant—a linear storage problem, Amer. Math. Monthly 81 (1974), 240–246.    [abstract]
  11. D. R. Woodall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B 15 (1973), 225–255.    [abstract]
  12. D. R. Woodall, Property B and the four-colour problem, in D. J. A. Welsh and D. R. Woodall, eds, Combinatorics, Proc. 1972 Oxford Combinatorial Conference (Institute of Mathematics and its Applications, Southend-on-Sea, 1972), 322–340.    [abstract]
  13. D. R. Woodall, Two results on infinite transversals, in D. J. A. Welsh and D. R. Woodall, eds, Combinatorics, Proc. 1972 Oxford Combinatorial Conference (Institute of Mathematics and its Applications, Southend-on-Sea, 1972), 341–350.    [abstract]
  14. D. R. Woodall, The induction of matroids by graphs, J. London Math. Soc. (2) 10 (1975), 27–35.    [abstract]
  15. D. R. Woodall, Applications of polymatroids and linear programming to transversals and graphs, in T. P. McDonough and V. C. Mavron, eds, Combinatorics, Proc. 1973 British Combinatorial Conference, LMS Lecture Note Series 13 (Cambridge University Press, 1974), 195–200.    [No abstract.]
  16. D. R. Woodall, An exchange theorem for bases of matroids, J. Combin. Theory Ser. B 16 (1974), 227–228.    [abstract]
  17. D. R. Woodall, A note on rank functions and integer programming, Discrete Math. 17 (1977), 215–218.    [abstract]
  18. D. R. Woodall, A sufficient condition for Hamiltonian circuits, J. Combin. Theory Ser. B 25 (1978), 184–186.    [abstract]
  19. D. R. Woodall, Maximal circuits of graphs I, Acta Math Acad. Sci. Hungar. 28 (1976), 77–80.    [No abstract.]
  20. D. R. Woodall, Maximal circuits of graphs II, Studia Sci. Math. Hungar. 10 (1975), 103–109.    [No abstract.]
  21. D. R. Woodall, Circuits containing specified edges, J. Combin. Theory Ser. B 22 (1977), 274–278.    [abstract]
  22. D. R. Woodall, A note on a problem of Halin's, J. Combin. Theory Ser. B 21 (1976), 132–134.    [No abstract.]
  23. D. R. Woodall, The inequality b ≥ v, in C. St J. A. Nash-Williams and J. Sheehan, eds, Proc. Fifth British Combinatorial Conference, Congressus Numerantium 15 (1975), 661–664.    [No abstract.]
  24. D. R. Woodall, Menger and König systems, in Y. Alavi and D. R. Lick, eds, Theory and Applications of Graphs, Lecture Notes in Mathematics 642 (Springer-Verlag, Berlin, Heidelberg and New York, 1978), 620–635.    [abstract]
  25. D. R. Woodall, A theorem on cubes, Mathematika 24 (1977), 60–62.    [abstract]
  26. D. R. Woodall, Zeros of chromatic polynomials, in P. J. Cameron, ed., Combinatorial Surveys, Proc. Sixth British Combinatorial Conference (Academic Press, London and New York, 1977), 199–223.    [abstract]
  27. D. R. Woodall, Minimax theorems in graph theory, in L. W. Beineke and R. J. Wilson, eds, Selected Topics in Graph Theory (Academic Press, London and New York, 1978), 237–269.    [No abstract.]
  28. [duplicates items 8 and 9 in the list of school, student and popular articles]    [No abstract.]
  29. D. R. Woodall and R. J. Wilson, The Appel–Haken proof of the four-color theorem, in L. W. Beineke and R. J. Wilson, eds, Selected Topics in Graph Theory (Academic Press, London and New York, 1978), 83–101.    [No abstract.]
  30. B. Bollobás, D. L. Goldsmith and D. R. Woodall, Indestructive deletions of edges from graphs, J. Combin. Theory Ser. B 30 (1981), 263–275.    [abstract]
  31. D. R. Woodall, Dividing a cake fairly, J. Math. Anal. Appl. 78 (1980), 233–247.    [abstract]
  32. D. R. Woodall, Some notes on Feinberg's k-independence problem, J. Combin. Theory Ser. B 32 (1982), 350–352.    [abstract]
  33. D. R. Woodall, Vector transversals, J. Combin. Theory Ser. B 32 (1982), 189–205.    [abstract]
  34. (with 9 others, under the pseudonym W. E. Opencomb)  On the intricacy of combinatorial construction problems, Discrete Math. 50 (1984), 71–97.    [abstract]
  35. W. Stromquist and D. R. Woodall, Sets on which several measures agree, J. Math. Anal. Appl. 108 (1985), 241–248.    [abstract]
  36. J. G. Kingston, C. Rogers and D. R. Woodall, Reciprocal auto-Bäcklund transformations, J. Phys. A: Math. Gen. 17 (1984), L35–L38.    [abstract]
  37. L. J. Cowen, R. H. Cowen and D. R. Woodall, Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency, J. Graph Theory 10 (1986), 187–195.    [abstract]
  38. D. R. Woodall, A note on the cake-division problem, J. Combin. Theory Ser. A 42 (1986), 300–301.    [No abstract.]
  39. [duplicates item 13 in the list of school, student and popular articles]    [No abstract.]
  40. D. R. Woodall, Subcontraction-equivalence and Hadwiger's conjecture, J. Graph Theory 11 (1987), 197–204.    [abstract]
  41. D. R. Woodall, An impossibility theorem for electoral systems, Discrete Math. 66 (1987), 209–211.    [abstract]
  42. I. D. Hill, B. A. Wichmann and D. R. Woodall, Algorithm 123: Single transferable vote by Meek's method, Computer Journal 30 (1987), 277–281.    [No abstract.]
  43. P. Katerinis and D. R. Woodall, Binding numbers of graphs and the existence of k-factors, Quart. J. Math. (2) 38 (1987), 221–228.    [abstract]
  44. D. R. Woodall, k-factors and neighbourhoods of independent sets in graphs, J. London Math. Soc. (2) 41 (1990), 385–392.    [abstract]
  45. D. R. Woodall, A proof of McKee's Eulerian-bipartite characterization, Discrete Math. 84 (1990), 217–220.    [abstract]
  46. D. R. Woodall, Forbidden graphs for degree and neighbourhood conditions, Discrete Math. 75 (1989), 387–404.    [abstract]
  47. I. Rinsma, C. H. C. Little and D. R. Woodall, Maximal matchings in graphs with large neighbourhoods of independent vertices, J. Graph Theory 14 (1990), 167–171.    [abstract]
  48. D. R. Woodall, Improper colourings of graphs, in R. Nelson and R. J. Wilson, eds, Graph Colourings, Pitman Research Notes in Mathematics 218 (Longman, Harlow, Essex, 1990), 45–63.    [No abstract.]
  49. D. R. Woodall, Local and global proportionality, Discrete Math. 102 (1992), 315–328.    [abstract]
  50. D. R. Woodall, Cycle lengths and circuit matroids of graphs, Discrete Math. 105 (1992), 269–273.    [abstract]
  51. D. R. Woodall, A short proof of a theorem of Dirac's about Hadwiger's conjecture, J. Graph Theory 16 (1992), 79–80.    [abstract]
  52. D. R. Woodall, Generalizations of Hadwiger's Conjecture, Ars Combin. 32 (1991), 289–292.    [abstract]
  53. D. R. Woodall, An inequality for chromatic polynomials, Discrete Math. 101 (1992), 327–331.    [abstract]
  54. D. R. Woodall, A zero-free interval for chromatic polynomials, Discrete Math. 101 (1992), 333–341; erratum in Discrete Math. 275 (2004), 385–390.    [abstract]
  55. D. R. Woodall, Cyclic-order graphs and Zarankiewicz's crossing-number conjecture, J. Graph Theory 17 (1993), 657–671.    [abstract]
  56. C. D. Wakelin and D. R. Woodall, Chromatic polynomials, polygon trees, and outerplanar graphs, J. Graph Theory 16 (1992), 459–466.    [abstract]
  57. M. A. Seoud and D. R. Woodall, Primary graphs, Ars Combin. 38 (1994), 299–308.    [abstract]
  58. D. E. Manolopoulos, P. W. Fowler and D. R. Woodall, Electronic stability of fullerenes: eigenvalue theorems for leapfrog carbon clusters, J. Chem. Soc. Faraday Trans. 88 (1992), 2427–2435.    [abstract]
  59. J. D. Lamb, G. M. Asher and D. R. Woodall, Causal loops and Mason's rule for bond graphs, in J. J. Granada and F. E. Cellier, eds, Internat. Conf. on Bond Graph Modeling (ICBGM '93), Society for Computer Simulation, Simulation Series 25(2) (1993), 67–72.    [abstract]
  60. J. D. Lamb, D. R. Woodall and G. M. Asher, Singular bond graphs, in J. J. Granada and F. E. Cellier, eds, Internat. Conf. on Bond Graph Modeling (ICBGM '93), Society for Computer Simulation, Simulation Series 25(2) (1993), 73–78.    [abstract]
  61. J. D. Lamb, D. R. Woodall and G. M. Asher, Equivalences of bond graph junction structures, in J. J. Granada and F. E. Cellier, eds, Internat. Conf. on Bond Graph Modeling (ICBGM '93), Society for Computer Simulation, Simulation Series 25(2) (1993), 79–84.    [abstract]
  62. J. D. Lamb, G. M. Asher and D. R. Woodall, Network realisation of bond graphs, in J. J. Granada and F. E. Cellier, eds, Internat. Conf. on Bond Graph Modeling (ICBGM '93), Society for Computer Simulation, Simulation Series 25(2) (1993), 85–90.    [abstract]
  63. J. D. Lamb, D. R. Woodall and G. M. Asher, Bond graphs I: acausal equivalence, Discrete Applied Math. 72 (1997), 261–293.    [abstract]
  64. J. D. Lamb, D. R. Woodall and G. M. Asher, Bond graphs II: causality and singularity, Discrete Applied Math. 73 (1997), 143–173.    [abstract]
  65. D. R. Woodall, An identity involving 3-regular graphs, Discrete Math. 152 (1996), 287–293.    [abstract]
  66. A. N. Walker and D. R. Woodall, Parity sequences of triangulated polygons, Bull. Inst. Combin. Appl. 11 (1994), 45–48.    [abstract]
  67. J. D. Lamb, G. M. Asher and D. R. Woodall, Bond graphs III: bond graphs and electrical networks, Discrete Applied Math. 73 (1997), 211–250.    [abstract]
  68. O. V. Borodin and D. R. Woodall, Thirteen colouring numbers for outerplane graphs, Bull. Inst. Combin. Appl. 14 (1995), 87–100.    [abstract]
  69. D. R. Woodall, The largest real zero of the chromatic polynomial, Discrete Math. 172 (1997), 141–153.    [abstract]
  70. D. R. Woodall, A note on Fisher's inequality, J. Combin. Theory Ser. A 77 (1997), 171–176.    [abstract]
  71. D. R. Woodall, Monotonicity of single-seat preferential election rules, Discrete Applied Math. 77 (1997), 81–98.    [abstract]
  72. O. V. Borodin and D. R. Woodall, Colourfully panconnected subgraphs, Congressus Numerantium 113 (1996), 19–30.    [abstract]
  73. O. V. Borodin, A. V. Kostochka and D. R. Woodall, Total colorings of planar graphs with large maximum degree, J. Graph Theory 26 (1997), 53–59.    [abstract]
  74. O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total colourings of multigraphs, J. Combin. Theory Ser. B 71 (1997), 184–204.    [abstract]
  75. O. V. Borodin, A. V. Kostochka and D. R. Woodall, Total colourings of planar graphs with large girth, European J. Combin. 19 (1998), 19–24.    [abstract]
  76. O. V. Borodin, A. V. Kostochka and D. R. Woodall, On kernel-perfect orientations of line graphs, Discrete Math. 191 (1998), 45–49.    [abstract]
  77. O. V. Borodin and D. R. Woodall, Short cycles of low weight in normal plane maps with minimum degree 5, Discus. Math. Graph Theory 18 (1998), 159–164.    [abstract]
  78. O. V. Borodin and D. R. Woodall, Weight of faces in plane maps, Mat. Zametki 64 (1998), 648–657 [in Russian]; English translation in Math. Notes 64 (1998), 562–570.    [abstract]
  79. D. Peterson and D. R. Woodall, Edge-choosability in line-perfect multigraphs, Discrete Math. 202 (1999), 191–199; erratum in Discrete Math. 260 (2003), 323–326.    [abstract]
  80. D. R. Woodall, Edge-choosability of multicircuits, Discrete Math. 202 (1999), 271–277.    [abstract]
  81. D. G. Fon-Der-Flaass, A. V. Kostochka and D. R. Woodall, Transversals in uniform hypergraphs with property (7,2), Discrete Math. 207 (1999), 277–284.    [abstract]
  82. O. V. Borodin and D. R. Woodall, Cyclic degrees of 3-polytopes, Graphs Combin. 15 (1999), 267–277.    [abstract]
  83. O. V. Borodin, A. V. Kostochka and D. R. Woodall, Acyclic colourings of planar graphs with large girth, J. London Math. Soc. (2) 60 (1999), 344–352.    [abstract]
  84. A. V. Kostochka and D. R. Woodall, On the number of edges in hypergraphs critical with respect to strong colourings, European J. Combin. 21 (2000), 249–255.    [abstract]
  85. P. C. Fishburn and D. R. Woodall, Cycle orders, Order 16 (1999), 149–164.    [abstract]
  86. A. M. Robertshaw and D. R. Woodall, Triangles and neighbourhoods of independent sets in graphs, J. Combin. Theory Ser. B 80 (2000), 122–129.    [abstract]
  87. D. R. Woodall, List colourings of graphs, in J. W. P. Hirschfeld, ed, Surveys in Combinatorics, 2001, London Math. Soc. Lecture Note Series 288, Cambridge University Press, 2001, 269–301.    [abstract]
  88. A. V. Kostochka and D. R. Woodall, Sparse sets in the complements of graphs with given girth, Discrete Math. 233 (2001), 163–174.    [abstract]
  89. A. V. Kostochka and D. R. Woodall, Density conditions for panchromatic colourings of hypergraphs, Combinatorica 21 (2001), 515–541.    [abstract]
  90. A. V. Kostochka and D. R. Woodall, Choosability conjectures and multicircuits, Discrete Math. 240 (2001), 123–143.    [abstract]
  91. D. R. Woodall, Tutte polynomial expansions for 2-separable graphs, Discrete Math. 247 (2002), 201–213.    [abstract]
  92. A. M. Robertshaw and D. R. Woodall, Binding number conditions for matching extension, Discrete Math. 248 (2002), 169–179.    [abstract]
  93. A. V. Kostochka and D. R. Woodall, Total choosability of multicircuits I, J. Graph Theory 40 (2002), 26–43.    [abstract]    doi:10.1002/jgt.10029
  94. A. V. Kostochka and D. R. Woodall, Total choosability of multicircuits II, J. Graph Theory 40 (2002), 44–67.    [abstract]    doi:10.1002/jgt.10030
  95. O. V. Borodin and D. R. Woodall, Cyclic colorings of 3-polytopes with large maximum face size, SIAM J. Discrete Math. 15 (2002), 143–154.    [abstract]
  96. D. R. Woodall, Defective choosability results for outerplanar and related graphs, Discrete Math. 258 (2002), 215–223.    [abstract]
  97. A. Prowse and D. R. Woodall, Choosability of powers of circuits, Graphs Combin. 19 (2003), 137–144.    [abstract]    doi:10.1007/s00373-002-0486-8
  98. D. R. Woodall, Defective choosability of graphs with no edge-plus-independent-set minor, J. Graph Theory 45 (2004), 51–56.    [abstract]    doi:10.1002/jgt.10153
  99. A. V. Kostochka and D. R. Woodall, Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders, European J. Combin. 26 (2005), 1119–1138.    [abstract]    doi:10.1016/j.ejc.2004.04.014
  100. D. R. Woodall, Total 4-choosability of series-parallel graphs, Electronic J. Combin. 13 (2006), #R97, 36pp.    [abstract]    [paper]
  101. T. J. Hetherington and D. R. Woodall, Edge and total choosability of near-outerplanar graphs, Electronic J. Combin. 13 (2006), #R98, 7pp.    [abstract]    [paper]
  102. D. R. Woodall, Some totally 4-choosable multigraphs, Discuss. Math. Graph Theory 27 (2007), 425–455.    [abstract]
  103. D. R. Woodall, The average degree of an edge-chromatic critical graph, Discrete Math. 308 (2008), 803–819.    [abstract]    doi:10.1016/j.disc.2007.07.048
  104. D. R. Woodall, The average degree of an edge-chromatic critical graph II, J. Graph Theory 56 (2007), 194–218.    [abstract]    doi:10.1002/jgt.20259
  105. T. J. Hetherington and D. R. Woodall, List-colouring the square of a K4-minor-free graph, Discrete Math. 308 (2008), 4037–4043.    [abstract]    doi:10.1016/j.disc.2007.07.102
  106. D. R. Woodall, An inverse binomial function and graph colourings, Bull. Inst. Combin. Appl. 53 (2008), 73–76.    [abstract]
  107. Z.-F. Zhang, D. R. Woodall, B. Yao, J.-W. Li, X.-E. Chen and L. Bian, Adjacent strong edge colorings and total colorings of regular graphs, Science in China Series A: Mathematics 52 (2009), 973–980.    [abstract]
  108. R. G. Wood and D. R. Woodall, Defective choosability of graphs without small minors, Electronic J. Combin. 16 (2009), #R92, 13pp.    [abstract]    [paper]
  109. A. V. Kostochka, L. Özkahya and D. R. Woodall, A Brooks-type bound for squares of K4-minor-free graphs, Discrete Math. 309 (2009), 6572–6584.    [abstract]    doi:10.1016/j.disc.2009.07.004
  110. D. R. Woodall, The average degree of a multigraph critical with respect to edge or total choosability, Discrete Math. 310 (2010), 1167–1171.    [abstract]    doi:10.1016/j.disc.2009.11.011
  111. D. R. Woodall, More elementary lower bounds on the matching number of a bipartite graph, Bull. Inst. Combin. Appl. 58 (2010), 99–102.    [abstract]
  112. D. R. Woodall, The independence number of an edge-chromatic critical graph, J. Graph Theory 66 (2011), 98–103.    [abstract]    doi:10.1002/jgt.20493
  113. A. V. Kostochka, M. Stiebitz and D. R. Woodall, Ohba's conjecture for graphs with independence number five, Discrete Math. 311 (2011), 996–1005.    [abstract]    doi:10.1016/j.disc.2011.02.026
  114. D. R. Woodall, Defective choosability of graphs in surfaces, Discuss. Math. Graph Theory 31 (2011), 441–459.    [abstract]
  115. T. J. Hetherington and D. R. Woodall, List-colouring the square of an outerplanar graph, Ars Combin. 101 (2011), 333–342.    [abstract]
  116. D. R. Woodall, Colourfully panconnected subgraphs II, Ars Combin. 106 (2012), 367–380.    [abstract]
  117. D. Bauer, N. Kahl, E. Schmeichel, D. R. Woodall and M. Yatauro, Improving theorems in a best monotone sense, Congressus Numerantium 216 (2013), 87–95.    [abstract]
  118. D. Bauer, N. Kahl, E. Schmeichel, D. R. Woodall and M. Yatauro, Toughness and binding number, Discrete Applied Math. 165 (2014), 60–68.    [abstract]    doi:10.1016/j.dam.2012.08.007
Papers not yet in print (in order of submission)
Dr Woodall's personal home page       start of current page

Valid HTML 4.01!