Neil Robertson

Inf. Sci., 2021

2019

Excluded minors in cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Girth Six Cubic Graphs Have Petersen Minors.

[BibT_eX]

[DOI]

Comb., 2019

2017

Cyclically five-connected cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Flexibility of projective-planar embeddings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

2016

The structure of graphs not topologically containing the Wagner graph.

[BibT_eX]

[DOI]

John Maharry

J. Comb. Theory B, 2016

2015

Excluding A Grid Minor In Planar Digraphs.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Discharging cartwheels.

[BibT_eX]

[DOI]

CoRR, 2014

Reducibility in the Four-Color Theorem.

[BibT_eX]

[DOI]

CoRR, 2014

2012

Graph Minors. XXII. Irrelevant vertices in linkage problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

2011

On a Conjecture Concerning the Petersen Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Hadwiger number and chromatic number for near regular degree sequences.

[BibT_eX]

[DOI]

Zi-Xia Song

J. Graph Theory, 2010

Graph minors XXIII. Nash-Williams' immersion conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

K4-free graphs with no odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

2009

Graph minors. XXI. Graphs with unique linkages.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

2008

On the flexibility of toroidal embeddings.

[BibT_eX]

[DOI]

Xiaoya Zha

Yue Zhao

J. Comb. Theory B, 2008

2006

Obstructions to branch-decomposition of matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

2005

On structural descriptions of lower ideals of trees.

[BibT_eX]

[DOI]

Yared Nigussie

J. Graph Theory, 2005

2004

Graph Minors. XIX. Well-quasi-ordering on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Graph Minors. XX. Wagner's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

2003

Progress on perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2003

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Graph Minors. XVI. Excluding a non-planar graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

On the excluded minors for the matroids of branch-width k.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

2001

Flexibility of Polyhedral Embeddings of Graphs in Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Directed Tree-Width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Closed 2-cell embeddings of graphs with no V8-minors.

[BibT_eX]

[DOI]

Xiaoya Zha

Discret. Math., 2001

Paul Catlin 1948-1995.

[BibT_eX]

[DOI]

Arthur M. Hobbs

Hong-Jian Lai

Discret. Math., 2001

1999

Graph Minors: XVII. Taming a Vortex.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

1997

Tutte's Edge-Colouring Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

The Four-Colour Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Graph Minors: XV. Giant Steps.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Disjoint Essential Cycles.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Planar Graphs on Nonplanar Surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

Planar graphs on the projective plane.

[BibT_eX]

[DOI]

Richard P. Vitray

Discret. Math., 1996

Packing Directed Circuits.

[BibT_eX]

[DOI]

Comb., 1996

Efficiently Four-Coloring Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Computing the orientable genus of projective graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Sachs' Linkless Embedding Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Petersen Family Minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Kuratowski Chains.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XIII. The Disjoint Paths Problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XII. Distance on a Surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Graph Minors .XIV. Extending an Embedding.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

1994

Quickly Excluding a Planar Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Graph Minors. XI. Circuits on a Surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

1993

Hadwiger's conjecture for K 6-free graphs.

[BibT_eX]

[DOI]

Comb., 1993

1991

On the orientable genus of graphs embedded in the klein bottle.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Graph minors. X. Obstructions to tree-decomposition.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Quickly excluding a forest.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Excluding infinite minors.

[BibT_eX]

[DOI]

Discret. Math., 1991

Structural descriptions of lower ideals of trees.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

A survey of linkless embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Structure Theory, 1991

Excluding a graph with one crossing.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Finding disjoint trees in planar graphs in linear time.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

Disjoint Essential Circuits in Toroidal Maps.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

1990

Graph minors. VIII. A kuratowski theorem for general surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Graph minors. IV. Tree-width and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Graph minors. IX. Disjoint crossed paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

1988

Graph minors. VII. Disjoint paths on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

1986

Graph minors. VI. Disjoint paths across a disc.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Graph minors. V. Excluding a planar graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Graph Minors. II. Algorithmic Aspects of Tree-Width.

[BibT_eX]

[DOI]

J. Algorithms, 1986

1984

Graph minors. III. Planar tree-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

1983

Graph minors. I. Excluding a forest.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

1980

On the maximum number of diagonals of a circuit in a graph.

[BibT_eX]

[DOI]

Ram Prakash Gupta

Jeff Kahn

Discret. Math., 1980

1974

Path traversability in planar graphs.

[BibT_eX]

[DOI]

Michael D. Plummer