Douglas R. Woodall - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 76 from 76

2019

The average degree of a subcubic edge?chromatic critical graphDouglas R. Woodall. jgt, 91(2):103-121, 2019. [doi]

Erratum: The average degree of an edge-chromatic critical graph IIDouglas R. Woodall. jgt, 92(4):488-490, 2019. [doi]

2015

2014

Toughness and binding numberDouglas Bauer, Nathan Kahl, Edward F. Schmeichel, Douglas R. Woodall, M. Yatauro. DAM, 165:60-68, 2014. [doi]

5 in 3-polytopes with minimum degree 5Oleg V. Borodin, Anna O. Ivanova, Douglas R. Woodall. DM, 334:63-69, 2014. [doi]

2012

Colourfully panconnected subgraphs IIDouglas R. Woodall. arscom, 106:367-380, 2012.

2011

List-colouring the square of an outerplanar graphTimothy J. Hetherington, Douglas R. Woodall. arscom, 101:333-342, 2011.

Ohba s conjecture for graphs with independence number fiveAlexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall. DM, 311(12):996-1005, 2011. [doi]

Defective choosability of graphs in surfacesDouglas R. Woodall. dmgt, 31(3):441-459, 2011. [doi]

The independence number of an edge-chromatic critical graphDouglas R. Woodall. jgt, 66(2):98-103, 2011. [doi]

2010

The average degree of a multigraph critical with respect to edge or total choosabilityDouglas R. Woodall. DM, 310(6-7):1167-1171, 2010. [doi]

2009

A Brooks-type bound for squares of K::4::-minor-free graphsAlexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall. DM, 309(23-24):6572-6584, 2009. [doi]

Defective Choosability of Graphs without Small MinorsRupert G. Wood, Douglas R. Woodall. combinatorics, 16(1), 2009. [doi]

2008

The average degree of an edge-chromatic critical graphDouglas R. Woodall. DM, 308(5-6):803-819, 2008. [doi]

2007

The average degree of an edge-chromatic critical graph IIDouglas R. Woodall. jgt, 56(3):194-218, 2007. [doi]

Some totally 4-choosable multigraphsDouglas R. Woodall. dmgt, 27(3):425-455, 2007. [doi]

2006

Edge and Total Choosability of Near-Outerplanar GraphsTimothy J. Hetherington, Douglas R. Woodall. combinatorics, 13(1), 2006. [doi]

Total 4-Choosability of Series-Parallel GraphsDouglas R. Woodall. combinatorics, 13(1), 2006. [doi]

2005

Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expandersAlexandr V. Kostochka, Douglas R. Woodall. ejc, 26(7):1119-1138, 2005. [doi]

PrefaceDouglas R. Woodall. DM, 293(1-3):1, 2005. [doi]

2004

Defective choosability of graphs with no edge-plus-independent-set minorDouglas R. Woodall. jgt, 45(1):51-56, 2004. [doi]

2003

Erratum to Edge-choosability in line-perfect multigraphs [Discrete Mathematics 202 (1999) 191]Dale Peterson, Douglas R. Woodall. DM, 260(1-3):323-326, 2003. [doi]

Choosability of Powers of CircuitsAnton Prowse, Douglas R. Woodall. gc, 19(1):137-144, 2003. [doi]

PrefaceDouglas R. Woodall. DM, 266(1-3):1-2, 2003. [doi]

2002

Cyclic Colorings of 3-Polytopes with Large Maximum Face SizeOleg V. Borodin, Douglas R. Woodall. siamdm, 15(2):143-154, 2002. [doi]

Total choosability of multicircuits IIAlexandr V. Kostochka, Douglas R. Woodall. jgt, 40(1):44-67, 2002. [doi]

Total choosability of multicircuits IAlexandr V. Kostochka, Douglas R. Woodall. jgt, 40(1):26-43, 2002. [doi]

Binding number conditions for matching extensionAndrew M. Robertshaw, Douglas R. Woodall. DM, 248(1-3):169-179, 2002. [doi]

Defective choosability results for outerplanar and related graphsDouglas R. Woodall. DM, 258(1-3):215-223, 2002. [doi]

Tutte polynomial expansions for 2-separable graphsDouglas R. Woodall. DM, 247(1-3):201-213, 2002. [doi]

2001

Choosability conjectures and multicircuitsAlexandr V. Kostochka, Douglas R. Woodall. DM, 240(1-3):123-143, 2001. [doi]

Sparse sets in the complements of graphs with given girthAlexandr V. Kostochka, Douglas R. Woodall. DM, 233(1-3):163-174, 2001. [doi]

Density Conditions for Panchromatic Colourings of HypergraphsAlexandr V. Kostochka, Douglas R. Woodall. combinatorica, 21(4):515-541, 2001. [doi]

PrefaceDouglas R. Woodall. DM, 231(1-3):1-2, 2001. [doi]

2000

On the Number of Edges in Hypergraphs Critical with Respect to Strong ColouringsAlexandr V. Kostochka, Douglas R. Woodall. ejc, 21(2):249-255, 2000. [doi]

Triangles and Neighbourhoods of Independent Sets in GraphsAndrew M. Robertshaw, Douglas R. Woodall. JCT, 80(1):122-129, 2000. [doi]

1999

Cyclic Degrees of 3-PolytopesOleg V. Borodin, Douglas R. Woodall. gc, 15(3):267-277, 1999. [doi]

Transversals in uniform hypergraphs with property (7, 2)Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall. DM, 207(1-3):277-284, 1999. [doi]

Edge-choosability in line-perfect multigraphsDale Peterson, Douglas R. Woodall. DM, 202(1-3):191-199, 1999. [doi]

Edge-choosability of multicircuitsDouglas R. Woodall. DM, 202(1-3):271-277, 1999. [doi]

1998

Short cycles of low weight in normal plane maps with minimum degree 5Oleg V. Borodin, Douglas R. Woodall. dmgt, 18(2):159-164, 1998. [doi]

On kernel-perfect orientations of line graphsOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall. DM, 191(1-3):45-49, 1998. [doi]

Total Colourings of Planar Graphs with Large GirthOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall. ejc, 19(1):19-24, 1998. [doi]

1997

Total colorings of planar graphs with large maximum degreeOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall. jgt, 26(1):53-59, 1997. [doi]

List Edge and List Total Colourings of MultigraphsOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall. JCT, 71(2):184-204, 1997. [doi]

Bond Graphs II: Causality and SingularityJohn D. Lamb, Douglas R. Woodall, Gregory M. Asher. DAM, 73(2):143-173, 1997. [doi]

Bond Graphs III: Bond Graphs and Electrical NetworksJohn D. Lamb, Gregory M. Asher, Douglas R. Woodall. DAM, 73(3):211-250, 1997. [doi]

Bond Graphs I: Acausal EquivalenceJohn D. Lamb, Douglas R. Woodall, Gregory M. Asher. DAM, 72(3):261-293, 1997. [doi]

The largest real zero of the chromatic polynomialDouglas R. Woodall. DM, 172(1-3):141-153, 1997. [doi]

Monotonicity of Single-seat Preferential Election RulesDouglas R. Woodall. DAM, 77(1):81-98, 1997. [doi]

A Note on Fisher s InequalityDouglas R. Woodall. JCT, 77(1):171-176, 1997. [doi]

1996

An identity involving 3-regular graphsDouglas R. Woodall. DM, 152(1-3):287-293, 1996. [doi]

1995

PrefaceDouglas R. Woodall. DM, 138(1-3):1-3, 1995. [doi]

1993

Cyclic-order graphs and Zarankiewicz's crossing-number conjectureDouglas R. Woodall. jgt, 17(6):657-671, 1993. [doi]

1992

Chromatic polynomials, polygon trees, and outerplanar graphsC. D. Wakelin, Douglas R. Woodall. jgt, 16(5):459-466, 1992. [doi]

A zero-free interval for chromatic polynomialsDouglas R. Woodall. DM, 101(1-3):333-341, 1992. [doi]

An inequality for chromatic polynomialsDouglas R. Woodall. DM, 101(1-3):327-331, 1992. [doi]

Cycle lengths and circuit matroids of graphsDouglas R. Woodall. DM, 105(1-3):269-273, 1992. [doi]

Local and global proportionalityDouglas R. Woodall. DM, 102(3):315-328, 1992. [doi]

A short proof of a theorem of dirac's about hadwiger's conjectureDouglas R. Woodall. jgt, 16(1):79-80, 1992. [doi]

1990

Maximal matchings in graphs with large neighborhoods of independent verticesI. Rinsma, C. H. C. Little, Douglas R. Woodall. jgt, 14(2):167-171, 1990. [doi]

A proof of McKee s eulerian-bipartite characterizationDouglas R. Woodall. DM, 84(2):217-220, 1990. [doi]

1989

Forbidden graphs for degree and neighbourhood conditionsDouglas R. Woodall. DM, 75(1-3):387-404, 1989. [doi]

1987

An impossibility theorem for electoral systemsDouglas R. Woodall. DM, 66(1-2):209-211, 1987. [doi]

Subcontraction-equivalence and Hadwiger's conjectureDouglas R. Woodall. jgt, 11(2):197-204, 1987. [doi]

1986

A note on the cake-division problemDouglas R. Woodall. JCT, 42(2):300-301, 1986. [doi]

1982

Some notes on feinberg s ::::k::::-independence problemDouglas R. Woodall. JCT, 32(3):350-352, 1982. [doi]

Vector transversalsDouglas R. Woodall. JCT, 32(2):189-205, 1982. [doi]

1981

Indestructive deletions of edges from graphsBéla Bollobás, D. L. Goldsmith, Douglas R. Woodall. JCT, 30(3):263-275, 1981. [doi]

1978

A sufficient condition for hamiltonian circuitsDouglas R. Woodall. JCT, 25(2):184-186, 1978. [doi]

1977

Circuits containing specified edgesDouglas R. Woodall. JCT, 22(3):274-278, 1977. [doi]

A note on rank functions and integer programmingDouglas R. Woodall. DM, 17(2):215-218, 1977. [doi]

1976

A note on a problem of Halin sDouglas R. Woodall. JCT, 21(2):132-134, 1976. [doi]

1973

Distances Realized by Sets Covering the PlaneDouglas R. Woodall. JCT, 14(2):187-200, 1973.

Sign in or sign up to see more results.

runs on WebDSL