default search action
Douglas R. Woodall
Person information
- affiliation: University of Nottingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j80]Douglas R. Woodall
:
The average degree of a subcubic edge?chromatic critical graph. J. Graph Theory 91(2): 103-121 (2019) - [j79]Douglas R. Woodall
Erratum: The average degree of an edge-chromatic critical graph II. J. Graph Theory 92(4): 488-490 (2019) - 2015
- [j78]Douglas Bauer
Best monotone degree conditions for binding number and cycle structure. Discret. Appl. Math. 195: 8-17 (2015) - [j77]Douglas R. Woodall
Towards size reconstruction from fewer cards. Discret. Math. 338(12): 2514-2522 (2015) - [j76]Douglas Bauer
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31(1): 1-22 (2015) - 2014
- [j75]Douglas Bauer
Toughness and binding number. Discret. Appl. Math. 165: 60-68 (2014) - [j74]Oleg V. Borodin, Anna O. Ivanova
Light C4 and C5 in 3-polytopes with minimum degree 5. Discret. Math. 334: 63-69 (2014) - 2012
- [j73]Douglas R. Woodall:
Colourfully panconnected subgraphs II. Ars Comb. 106: 367-380 (2012) - 2011
- [j72]Timothy J. Hetherington, Douglas R. Woodall:
List-colouring the square of an outerplanar graph. Ars Comb. 101: 333-342 (2011) - [j71]Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall:
Ohba's conjecture for graphs with independence number five. Discret. Math. 311(12): 996-1005 (2011) - [j70]Douglas R. Woodall:
Defective choosability of graphs in surfaces. Discuss. Math. Graph Theory 31(3): 441-459 (2011) - [j69]Douglas R. Woodall:
The independence number of an edge-chromatic critical graph. J. Graph Theory 66(2): 98-103 (2011) - 2010
- [j68]Douglas R. Woodall:
The average degree of a multigraph critical with respect to edge or total choosability. Discret. Math. 310(6-7): 1167-1171 (2010)
2000 – 2009
- 2009
- [j67]Rupert G. Wood, Douglas R. Woodall:
Defective Choosability of Graphs without Small Minors. Electron. J. Comb. 16(1) (2009) - [j66]Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall:
A Brooks-type bound for squares of K4-minor-free graphs. Discret. Math. 309(23-24): 6572-6584 (2009) - 2008
- [j65]Douglas R. Woodall:
The average degree of an edge-chromatic critical graph. Discret. Math. 308(5-6): 803-819 (2008) - [j64]Timothy J. Hetherington
List-colouring the square of a K4-minor-free graph. Discret. Math. 308(18): 4037-4043 (2008) - 2007
- [j63]Douglas R. Woodall:
Some totally 4-choosable multigraphs. Discuss. Math. Graph Theory 27(3): 425-455 (2007) - [j62]Douglas R. Woodall:
The average degree of an edge-chromatic critical graph II. J. Graph Theory 56(3): 194-218 (2007) - 2006
- [j61]Timothy J. Hetherington, Douglas R. Woodall:
Edge and Total Choosability of Near-Outerplanar Graphs. Electron. J. Comb. 13(1) (2006) - [j60]Douglas R. Woodall:
Total 4-Choosability of Series-Parallel Graphs. Electron. J. Comb. 13(1) (2006) - 2005
- [j59]Douglas R. Woodall:
Preface. Discret. Math. 293(1-3): 1- (2005) - [j58]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
- [j57]Douglas R. Woodall:
Defective choosability of graphs with no edge-plus-independent-set minor. J. Graph Theory 45(1): 51-56 (2004) - 2003
- [j56]Dale Peterson, Douglas R. Woodall:
Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191]. Discret. Math. 260(1-3): 323-326 (2003) - [j55]Douglas R. Woodall:
Preface. Discret. Math. 266(1-3): 1-2 (2003) - [j54]Anton Prowse, Douglas R. Woodall:
Choosability of Powers of Circuits. Graphs Comb. 19(1): 137-144 (2003) - 2002
- [j53]Douglas R. Woodall:
Tutte polynomial expansions for 2-separable graphs. Discret. Math. 247(1-3): 201-213 (2002) - [j52]Andrew M. Robertshaw, Douglas R. Woodall:
Binding number conditions for matching extension. Discret. Math. 248(1-3): 169-179 (2002) - [j51]Douglas R. Woodall:
Defective choosability results for outerplanar and related graphs. Discret. Math. 258(1-3): 215-223 (2002) - [j50]Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits I. J. Graph Theory 40(1): 26-43 (2002) - [j49]Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits II. J. Graph Theory 40(1): 44-67 (2002) - [j48]Oleg V. Borodin, Douglas R. Woodall:
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size. SIAM J. Discret. Math. 15(2): 143-154 (2002) - 2001
- [j47]Alexandr V. Kostochka, Douglas R. Woodall:
Density Conditions for Panchromatic Colourings of Hypergraphs. Comb. 21(4): 515-541 (2001) - [j46]Douglas R. Woodall:
Preface. Discret. Math. 231(1-3): 1-2 (2001) - [j45]Alexandr V. Kostochka, Douglas R. Woodall:
Sparse sets in the complements of graphs with given girth. Discret. Math. 233(1-3): 163-174 (2001) - [j44]Alexandr V. Kostochka, Douglas R. Woodall:
Choosability conjectures and multicircuits. Discret. Math. 240(1-3): 123-143 (2001) - 2000
- [j43]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) - [j42]Andrew M. Robertshaw, Douglas R. Woodall:
Triangles and Neighbourhoods of Independent Sets in Graphs. J. Comb. Theory B 80(1): 122-129 (2000)
1990 – 1999
- 1999
- [j41]Dale Peterson, Douglas R. Woodall:
Edge-choosability in line-perfect multigraphs. Discret. Math. 202(1-3): 191-199 (1999) - [j40]Douglas R. Woodall:
Edge-choosability of multicircuits. Discret. Math. 202(1-3): 271-277 (1999) - [j39]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall:
Transversals in uniform hypergraphs with property (7, 2). Discret. Math. 207(1-3): 277-284 (1999) - [j38]Oleg V. Borodin, Douglas R. Woodall:
Cyclic Degrees of 3-Polytopes. Graphs Comb. 15(3): 267-277 (1999) - [j37]Peter C. Fishburn, Douglas R. Woodall:
Cycle Orders. Order 16(2): 149-164 (1999) - 1998
- [j36]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
On kernel-perfect orientations of line graphs. Discret. Math. 191(1-3): 45-49 (1998) - [j35]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): 159-164 (1998) - [j34]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
- [j33]John D. Lamb
Bond Graphs I: Acausal Equivalence. Discret. Appl. Math. 72(3): 261-293 (1997) - [j32]John D. Lamb
Bond Graphs II: Causality and Singularity. Discret. Appl. Math. 73(2): 143-173 (1997) - [j31]John D. Lamb
Bond Graphs III: Bond Graphs and Electrical Networks. Discret. Appl. Math. 73(3): 211-250 (1997) - [j30]Douglas R. Woodall:
Monotonicity of Single-seat Preferential Election Rules. Discret. Appl. Math. 77(1): 81-98 (1997) - [j29]Douglas R. Woodall:
Preface. Discret. Math. 167-168: 1-2 (1997) - [j28]Douglas R. Woodall:
The largest real zero of the chromatic polynomial. Discret. Math. 172(1-3): 141-153 (1997) - [j27]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs. J. Comb. Theory B 71(2): 184-204 (1997) - [j26]Douglas R. Woodall:
A Note on Fisher's Inequality. J. Comb. Theory A 77(1): 171-176 (1997) - [j25]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total colorings of planar graphs with large maximum degree. J. Graph Theory 26(1): 53-59 (1997) - 1996
- [j24]Douglas R. Woodall:
An identity involving 3-regular graphs. Discret. Math. 152(1-3): 287-293 (1996) - 1995
- [j23]Douglas R. Woodall:
Preface. Discret. Math. 138(1-3): 1-3 (1995) - 1993
- [j22]Douglas R. Woodall:
Cyclic-order graphs and Zarankiewicz's crossing-number conjecture. J. Graph Theory 17(6): 657-671 (1993) - 1992
- [j21]Douglas R. Woodall:
An inequality for chromatic polynomials. Discret. Math. 101(1-3): 327-331 (1992) - [j20]Douglas R. Woodall:
A zero-free interval for chromatic polynomials. Discret. Math. 101(1-3): 333-341 (1992) - [j19]Douglas R. Woodall:
Local and global proportionality. Discret. Math. 102(3): 315-328 (1992) - [j18]Douglas R. Woodall:
Cycle lengths and circuit matroids of graphs. Discret. Math. 105(1-3): 269-273 (1992) - [j17]Douglas R. Woodall:
A short proof of a theorem of dirac's about hadwiger's conjecture. J. Graph Theory 16(1): 79-80 (1992) - [j16]C. D. Wakelin, Douglas R. Woodall:
Chromatic polynomials, polygon trees, and outerplanar graphs. J. Graph Theory 16(5): 459-466 (1992) - 1990
- [j15]Douglas R. Woodall:
A proof of McKee's eulerian-bipartite characterization. Discret. Math. 84(2): 217-220 (1990) - [j14]I. Rinsma, C. H. C. Little, Douglas R. Woodall:
Maximal matchings in graphs with large neighborhoods of independent vertices. J. Graph Theory 14(2): 167-171 (1990)
1980 – 1989
- 1989
- [j13]Douglas R. Woodall:
Forbidden graphs for degree and neighbourhood conditions. Discret. Math. 75(1-3): 387-404 (1989) - 1987
- [j12]Douglas R. Woodall:
An impossibility theorem for electoral systems. Discret. Math. 66(1-2): 209-211 (1987) - [j11]Douglas R. Woodall:
Subcontraction-equivalence and Hadwiger's conjecture. J. Graph Theory 11(2): 197-204 (1987) - 1986
- [j10]Douglas R. Woodall:
A note on the cake-division problem. J. Comb. Theory A 42(2): 300-301 (1986) - [j9]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): 187-195 (1986) - 1982
- [j8]Douglas R. Woodall:
Vector transversals. J. Comb. Theory B 32(2): 189-205 (1982) - [j7]Douglas R. Woodall:
Some notes on feinberg's k-independence problem. J. Comb. Theory B 32(3): 350-352 (1982) - 1981
- [j6]Béla Bollobás, Donald L. Goldsmith, Douglas R. Woodall:
Indestructive deletions of edges from graphs. J. Comb. Theory B 30(3): 263-275 (1981)
1970 – 1979
- 1978
- [j5]Douglas R. Woodall:
A sufficient condition for hamiltonian circuits. J. Comb. Theory B 25(2): 184-186 (1978) - 1977
- [j4]Douglas R. Woodall:
A note on rank functions and integer programming. Discret. Math. 17(2): 215-218 (1977) - [j3]Douglas R. Woodall:
Circuits containing specified edges. J. Comb. Theory B 22(3): 274-278 (1977) - 1976
- [j2]Douglas R. Woodall:
A note on a problem of Halin's. J. Comb. Theory B 21(2): 132-134 (1976) - 1973
- [j1]Douglas R. Woodall:
Distances Realized by Sets Covering the Plane. J. Comb. Theory A 14(2): 187-200 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: