Douglas R. Woodall

80 papers Journal 80

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