Douglas R. Woodall

From MaRDI portal
Revision as of 20:45, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:214988

Available identifiers

zbMath Open woodall.douglas-rWikidataQ102178307 ScholiaQ102178307MaRDI QIDQ214988

List of research outcomes

PublicationDate of PublicationType
Erratum: The average degree of an edge‐chromatic critical graph II2020-07-17Paper
The average degree of a subcubic edge‐chromatic critical graph2019-06-14Paper
Best monotone degree conditions for binding number and cycle structure2015-09-21Paper
Towards size reconstruction from fewer cards2015-08-05Paper
Best monotone degree conditions for graph properties: a survey2015-01-20Paper
Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 52014-08-14Paper
Toughness and binding number2014-05-05Paper
https://portal.mardi4nfdi.de/entity/Q54054652014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q28466522013-09-09Paper
https://portal.mardi4nfdi.de/entity/Q29185562012-10-08Paper
Defective choosability of graphs in surfaces2011-09-20Paper
Ohba's conjecture for graphs with independence number five2011-05-16Paper
The independence number of an edge-chromatic critical graph2011-03-07Paper
https://portal.mardi4nfdi.de/entity/Q35675442010-06-17Paper
The average degree of a multigraph critical with respect to edge or total choosability2010-04-27Paper
Defective choosability of graphs without small minors2010-03-26Paper
A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs2009-12-15Paper
Adjacent strong edge colorings and total colorings of regular graphs2009-12-02Paper
List-colouring the square of a \(K_4\)-minor-free graph2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q35142942008-07-21Paper
Some totally 4-choosable multigraphs2008-06-18Paper
The average degree of an edge-chromatic critical graph2008-02-14Paper
The average degree of an edge‐chromatic critical graph II2008-01-04Paper
Total 4-choosability of series-parallel graphs2007-03-12Paper
Edge and total choosability of near-outerplanar graphs2007-03-12Paper
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders2005-09-29Paper
Defective choosability of graphs with no edge-plus-independent-set minor2004-02-03Paper
Choosability of powers of circuits2003-07-08Paper
Triangles and neighbourhoods of independent sets in graphs2002-12-10Paper
Defective choosability results for outerplanar and related graphs2002-12-02Paper
Total choosability of multicircuits I2002-07-01Paper
Total choosability of multicircuits II2002-07-01Paper
Density conditions for panchromatic colourings of hypergraphs2002-06-25Paper
Tutte polynomial expansions for 2-separable graphs2002-05-28Paper
Binding number conditions for matching extension2002-05-28Paper
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size2002-04-23Paper
Sparse sets in the complements of graphs with given girth2002-04-16Paper
Choosability conjectures and multicircuits2002-04-09Paper
https://portal.mardi4nfdi.de/entity/Q27411802002-02-17Paper
Weight of faces in plane maps2001-04-16Paper
On kernel-perfect orientations of line graphs2000-11-02Paper
Acyclic Colourings of Planar Graphs with Large Girth2000-07-04Paper
On the number of edges in hypergraphs critical with respect to strong colourings2000-06-29Paper
Cycle orders2000-06-21Paper
Transversals in uniform hypergraphs with property (7, 2)2000-02-22Paper
Cyclic degrees of 3-polytopes2000-01-30Paper
Edge-choosability in line-perfect multigraphs2000-01-02Paper
Edge-choosability of multicircuits2000-01-02Paper
Short cycles of low weight in normal plane maps with minimum degree 51999-11-24Paper
https://portal.mardi4nfdi.de/entity/Q43862911998-10-19Paper
The largest real zero of the chromatic polynomial1998-06-01Paper
Total colourings of planar graphs with large girth1998-04-07Paper
Total colorings of planar graphs with large maximum degree1997-09-17Paper
List edge and list total colourings of multigraphs1997-09-15Paper
Monotonicity of single-seat preferential election rules1997-08-28Paper
Bond graphs. I: Acausal equivalence1997-08-10Paper
Bond graphs. II: Causality and singularity1997-08-03Paper
Bond graphs. III: Bond graphs and electrical networks1997-05-27Paper
A note on Fisher's inequality1997-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48731591996-08-22Paper
An identity involving 3-regular graphs1996-07-07Paper
https://portal.mardi4nfdi.de/entity/Q48465471995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q43262131995-07-11Paper
https://portal.mardi4nfdi.de/entity/Q43091231995-03-09Paper
Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture1994-07-24Paper
Chromatic polynomials, polygon trees, and outerplanar graphs1993-01-17Paper
An inequality for chromatic polynomials1993-01-16Paper
A zero-free interval for chromatic polynomials1993-01-16Paper
Cycle lengths and circuit matroids of graphs1993-01-16Paper
Local and global proportionality1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40007941992-09-26Paper
A short proof of a theorem of dirac's about hadwiger's conjecture1992-06-28Paper
A proof of McKee's Eulerian-bipartite characterization1992-06-25Paper
Maximal matchings in graphs with large neighborhoods of independent vertices1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q30353071990-01-01Paper
k -Factors and Neighbourhoods of Independent Sets in Graphs1990-01-01Paper
Forbidden graphs for degree and neighbourhood conditions1989-01-01Paper
An impossibility theorem for electoral systems1987-01-01Paper
BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS1987-01-01Paper
Subcontraction-equivalence and Hadwiger's conjecture1987-01-01Paper
A note on the cake-division problem1986-01-01Paper
How proportional is proportional representation?1986-01-01Paper
Sets on which several measures agree1985-01-01Paper
Reciprocal auto-Backlund transformations1984-01-01Paper
Vector transversals1982-01-01Paper
Some notes on Feinberg's k-independence problem1982-01-01Paper
Dividing a cake fairly1980-01-01Paper
A sufficient condition for Hamiltonian circuits1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38693741978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709271978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41720661978-01-01Paper
A note on rank functions and integer programming1977-01-01Paper
Circuits containing specified edges1977-01-01Paper
A theorem on cubes1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41286191977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41340101977-01-01Paper
A note on a problem of Halin's1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40834361976-01-01Paper
Maximal circuits of graphs. I1976-01-01Paper
The Induction of Matroids by Graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56801431974-01-01Paper
An exchange theorem for bases of matroids1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40475581974-01-01Paper
The Bay Restaurant--A Linear Storage Problem1974-01-01Paper
The binding number of a graph and its Anderson number1973-01-01Paper
Distances realized by sets covering the plane1973-01-01Paper
The binding number of a graph, and its Anderson number1973-01-01Paper
Sufficient Conditions for Circuits in Graphs1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56159421971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56266821971-01-01Paper
A market problem1971-01-01Paper
Square λ-Linked Designs1970-01-01Paper
The λ-μ Problem1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Douglas R. Woodall