Douglas R. Woodall

J. Graph Theory, 2019

The average degree of a subcubic edge?chromatic critical graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Best Monotone Degree Conditions for Graph Properties: A Survey.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Graphs Comb., 2015

Towards size reconstruction from fewer cards.

[BibT_eX]

[DOI]

Discret. Math., 2015

Best monotone degree conditions for binding number and cycle structure.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2015

Light C4 and C5 in 3-polytopes with minimum degree 5.

[BibT_eX]

[DOI]

,

Anna O. Ivanova

,

Discret. Math., 2014

Toughness and binding number.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2014

Colourfully panconnected subgraphs II.

[BibT_eX]

Ars Comb., 2012

The independence number of an edge-chromatic critical graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Defective choosability of graphs in surfaces.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Ohba's conjecture for graphs with independence number five.

[BibT_eX]

[DOI]

,

Michael Stiebitz

,

Discret. Math., 2011

List-colouring the square of an outerplanar graph.

[BibT_eX]

Timothy J. Hetherington

,

Ars Comb., 2011

The average degree of a multigraph critical with respect to edge or total choosability.

[BibT_eX]

[DOI]

Discret. Math., 2010

A Brooks-type bound for squares of K4-minor-free graphs.

[BibT_eX]

[DOI]

,

Lale Özkahya

,

Discret. Math., 2009

Defective Choosability of Graphs without Small Minors.

[BibT_eX]

[DOI]

Rupert G. Wood

,

Electron. J. Comb., 2009

The average degree of an edge-chromatic critical graph.

[BibT_eX]

[DOI]

Discret. Math., 2008

List-colouring the square of a K4-minor-free graph.

[BibT_eX]

[DOI]

Timothy J. Hetherington

,

Discret. Math., 2008

The average degree of an edge-chromatic critical graph II.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Some totally 4-choosable multigraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

Total 4-Choosability of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Edge and Total Choosability of Near-Outerplanar Graphs.

[BibT_eX]

[DOI]

Timothy J. Hetherington

,

Electron. J. Comb., 2006

Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2005

Defective choosability of graphs with no edge-plus-independent-set minor.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Choosability of Powers of Circuits.

[BibT_eX]

[DOI]

Anton Prowse

,

Graphs Comb., 2003

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2003

Erratum to "Edge-choosability in line-perfect multigraphs" [Discrete Mathematics 202 (1999) 191].

[BibT_eX]

[DOI]

Dale Peterson

,

Discret. Math., 2003

Cyclic Colorings of 3-Polytopes with Large Maximum Face Size.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2002

Total choosability of multicircuits II.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

Total choosability of multicircuits I.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2002

Tutte polynomial expansions for 2-separable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Defective choosability results for outerplanar and related graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Binding number conditions for matching extension.

[BibT_eX]

[DOI]

Andrew M. Robertshaw

,

Discret. Math., 2002

Sparse sets in the complements of graphs with given girth.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Choosability conjectures and multicircuits.

[BibT_eX]

[DOI]

,

Discret. Math., 2001

Density Conditions for Panchromatic Colourings of Hypergraphs.

[BibT_eX]

[DOI]

,

Comb., 2001

Triangles and Neighbourhoods of Independent Sets in Graphs.

[BibT_eX]

[DOI]

Andrew M. Robertshaw

,

J. Comb. Theory B, 2000

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2000

Cycle Orders.

[BibT_eX]

[DOI]

Peter C. Fishburn

,

Order, 1999

Cyclic Degrees of 3-Polytopes.

[BibT_eX]

[DOI]

,

Graphs Comb., 1999

Edge-choosability of multicircuits.

[BibT_eX]

[DOI]

Discret. Math., 1999

Edge-choosability in line-perfect multigraphs.

[BibT_eX]

[DOI]

Dale Peterson

,

Discret. Math., 1999

Transversals in uniform hypergraphs with property (7, 2).

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

,

,

Discret. Math., 1999

Total Colourings of Planar Graphs with Large Girth.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 1998

Short cycles of low weight in normal plane maps with minimum degree 5.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 1998

On kernel-perfect orientations of line graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 1998

Total colorings of planar graphs with large maximum degree.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 1997

A Note on Fisher's Inequality.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

List Edge and List Total Colourings of Multigraphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 1997

The largest real zero of the chromatic polynomial.

[BibT_eX]

[DOI]

Discret. Math., 1997

Monotonicity of Single-seat Preferential Election Rules.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Bond Graphs II: Causality and Singularity.

[BibT_eX]

[DOI]

John D. Lamb

,

,

Gregory M. Asher

Discret. Appl. Math., 1997

Bond Graphs I: Acausal Equivalence.

[BibT_eX]

[DOI]

John D. Lamb

,

,

Gregory M. Asher

Discret. Appl. Math., 1997

Bond Graphs III: Bond Graphs and Electrical Networks.

[BibT_eX]

[DOI]

John D. Lamb

,

Gregory M. Asher

,

Discret. Appl. Math., 1997

An identity involving 3-regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Cyclic-order graphs and Zarankiewicz's crossing-number conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

A short proof of a theorem of dirac's about hadwiger's conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

Chromatic polynomials, polygon trees, and outerplanar graphs.

[BibT_eX]

[DOI]

C. D. Wakelin

,

J. Graph Theory, 1992

Cycle lengths and circuit matroids of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Local and global proportionality.

[BibT_eX]

[DOI]

Discret. Math., 1992

A zero-free interval for chromatic polynomials.

[BibT_eX]

[DOI]

Discret. Math., 1992

An inequality for chromatic polynomials.

[BibT_eX]

[DOI]

Discret. Math., 1992

Maximal matchings in graphs with large neighborhoods of independent vertices.

[BibT_eX]

[DOI]

I. Rinsma

,

C. H. C. Little

,

J. Graph Theory, 1990

A proof of McKee's eulerian-bipartite characterization.

[BibT_eX]

[DOI]

Discret. Math., 1990

Forbidden graphs for degree and neighbourhood conditions.

[BibT_eX]

[DOI]

Discret. Math., 1989

Subcontraction-equivalence and Hadwiger's conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

An impossibility theorem for electoral systems.

[BibT_eX]

[DOI]

Discret. Math., 1987

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency.

[BibT_eX]

[DOI]

Lenore J. Cowen

,

Robert Cowen

,

J. Graph Theory, 1986

A note on the cake-division problem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Some notes on feinberg's k-independence problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1982

Vector transversals.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1982

Indestructive deletions of edges from graphs.

[BibT_eX]

[DOI]

Béla Bollobás

,

Donald L. Goldsmith

,

J. Comb. Theory B, 1981

A sufficient condition for hamiltonian circuits.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1978

Circuits containing specified edges.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1977

A note on rank functions and integer programming.

[BibT_eX]

[DOI]

Discret. Math., 1977

A note on a problem of Halin's.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1976

Distances Realized by Sets Covering the Plane.

[BibT_eX]

[DOI]