2021
BBAS: Towards large scale effective ensemble adversarial attacks against deep neural network learning.
Inf. Sci., 2021
2019
Excluded minors in cubic graphs.
J. Comb. Theory, Ser. B, 2019
Girth Six Cubic Graphs Have Petersen Minors.
Comb., 2019
2017
Cyclically five-connected cubic graphs.
J. Comb. Theory, Ser. B, 2017
Flexibility of projective-planar embeddings.
J. Comb. Theory, Ser. B, 2017
2016
The structure of graphs not topologically containing the Wagner graph.
J. Comb. Theory, Ser. B, 2016
2015
Excluding A Grid Minor In Planar Digraphs.
CoRR, 2015
2014
Reducibility in the Four-Color Theorem.
CoRR, 2014
2012
Graph Minors. XXII. Irrelevant vertices in linkage problems.
J. Comb. Theory, Ser. B, 2012
2011
On a Conjecture Concerning the Petersen Graph.
Electron. J. Comb., 2011
2010
Hadwiger number and chromatic number for near regular degree sequences.
J. Graph Theory, 2010
Graph minors XXIII. Nash-Williams' immersion conjecture.
J. Comb. Theory, Ser. B, 2010
K<sub>4</sub>-free graphs with no odd holes.
J. Comb. Theory, Ser. B, 2010
2009
Graph minors. XXI. Graphs with unique linkages.
J. Comb. Theory, Ser. B, 2009
2008
On the flexibility of toroidal embeddings.
J. Comb. Theory, Ser. B, 2008
2006
Obstructions to branch-decomposition of matroids.
J. Comb. Theory, Ser. B, 2006
2005
On structural descriptions of lower ideals of trees.
J. Graph Theory, 2005
2004
Graph Minors. XIX. Well-quasi-ordering on a surface.
J. Comb. Theory, Ser. B, 2004
Graph Minors. XX. Wagner's conjecture.
J. Comb. Theory, Ser. B, 2004
2003
Progress on perfect graphs.
Math. Program., 2003
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering.
J. Comb. Theory, Ser. B, 2003
Graph Minors. XVI. Excluding a non-planar graph.
J. Comb. Theory, Ser. B, 2003
On the excluded minors for the matroids of branch-width <i>k</i>.
J. Comb. Theory, Ser. B, 2003
2001
Flexibility of Polyhedral Embeddings of Graphs in Surfaces.
J. Comb. Theory, Ser. B, 2001
J. Comb. Theory, Ser. B, 2001
Closed 2-cell embeddings of graphs with no <i>V</i><sub>8</sub>-minors.
Discret. Math., 2001
1999
Graph Minors: XVII. Taming a Vortex.
J. Comb. Theory, Ser. B, 1999
1997
Tutte's Edge-Colouring Conjecture.
J. Comb. Theory, Ser. B, 1997
J. Comb. Theory, Ser. B, 1997
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
1996
Graph Minors: XV. Giant Steps.
J. Comb. Theory, Ser. B, 1996
Disjoint Essential Cycles.
J. Comb. Theory, Ser. B, 1996
Planar Graphs on Nonplanar Surfaces.
J. Comb. Theory, Ser. B, 1996
Planar graphs on the projective plane.
Discret. Math., 1996
Packing Directed Circuits.
Comb., 1996
Efficiently Four-Coloring Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Computing the orientable genus of projective graphs.
J. Graph Theory, 1995
Sachs' Linkless Embedding Conjecture.
J. Comb. Theory, Ser. B, 1995
J. Comb. Theory, Ser. B, 1995
J. Comb. Theory, Ser. B, 1995
Graph Minors .XIII. The Disjoint Paths Problem.
J. Comb. Theory, Ser. B, 1995
Graph Minors .XII. Distance on a Surface.
J. Comb. Theory, Ser. B, 1995
Graph Minors .XIV. Extending an Embedding.
J. Comb. Theory, Ser. B, 1995
1994
Quickly Excluding a Planar Graph.
J. Comb. Theory, Ser. B, 1994
Graph Minors. XI. Circuits on a Surface.
J. Comb. Theory, Ser. B, 1994
1993
Hadwiger's conjecture for K <sub>6</sub>-free graphs.
Comb., 1993
1991
On the orientable genus of graphs embedded in the klein bottle.
J. Graph Theory, 1991
Graph minors. X. Obstructions to tree-decomposition.
J. Comb. Theory, Ser. B, 1991
Quickly excluding a forest.
J. Comb. Theory, Ser. B, 1991
Excluding infinite minors.
Discret. Math., 1991
Structural descriptions of lower ideals of trees.
Proceedings of the Graph Structure Theory, 1991
A survey of linkless embeddings.
Proceedings of the Graph Structure Theory, 1991
Excluding a graph with one crossing.
Proceedings of the Graph Structure Theory, 1991
Finding disjoint trees in planar graphs in linear time.
Proceedings of the Graph Structure Theory, 1991
Disjoint Essential Circuits in Toroidal Maps.
Proceedings of the Planar Graphs, 1991
1990
Graph minors. VIII. A kuratowski theorem for general surfaces.
J. Comb. Theory, Ser. B, 1990
Graph minors. IV. Tree-width and well-quasi-ordering.
J. Comb. Theory, Ser. B, 1990
Graph minors. IX. Disjoint crossed paths.
J. Comb. Theory, Ser. B, 1990
1988
Graph minors. VII. Disjoint paths on a surface.
J. Comb. Theory, Ser. B, 1988
1986
Graph minors. VI. Disjoint paths across a disc.
J. Comb. Theory, Ser. B, 1986
Graph minors. V. Excluding a planar graph.
J. Comb. Theory, Ser. B, 1986
Graph Minors. II. Algorithmic Aspects of Tree-Width.
J. Algorithms, 1986
1984
Graph minors. III. Planar tree-width.
J. Comb. Theory, Ser. B, 1984
1983
Graph minors. I. Excluding a forest.
J. Comb. Theory, Ser. B, 1983
1980
On the maximum number of diagonals of a circuit in a graph.
Discret. Math., 1980
1974
Path traversability in planar graphs.
Discret. Math., 1974
