Paul Wollan

CoRR, 2020

2019

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor.

[BibT_eX]

[DOI]

David R. Wood

J. Graph Theory, 2019

K6 minors in 6-connected graphs of bounded tree-width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Chi-boundedness of graph classes excluding wheel vertex-minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Forcing clique immersions through chromatic number.

[BibT_eX]

[DOI]

Gregory Gauthier

Tien-Nam Le

Eur. J. Comb., 2019

A Unified Erdős-Pósa Theorem for Constrained Cycles.

[BibT_eX]

[DOI]

Tony Huynh

Felix Joos

Comb., 2019

2018

A new proof of the flat wall theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

K6 minors in large 6-connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

2017

Rooted grid minors.

[BibT_eX]

[DOI]

Paul D. Seymour

J. Comb. Theory B, 2017

Space proof complexity for random 3-CNFs.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Half-Integral Linkages in Highly Connected Directed Graphs.

[BibT_eX]

[DOI]

Katherine Edwards

Irene Muzi

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Finding Topological Subgraphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

A Structure Theorem for Strong Immersions.

[BibT_eX]

[DOI]

Zdenek Dvorák

J. Graph Theory, 2016

Stabilizer theorems for even cycle matroids.

[BibT_eX]

[DOI]

Bertrand Guenin

Irene Pivotto

J. Comb. Theory B, 2016

Forcing clique immersions through chromatic number.

[BibT_eX]

[DOI]

Tien-Nam Le

Electron. Notes Discret. Math., 2016

Displaying blocking pairs in signed graphs.

[BibT_eX]

[DOI]

Bertrand Guenin

Irene Pivotto

Eur. J. Comb., 2016

The Erdos-Posa Property for Directed Graphs.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Stephan Kreutzer

CoRR, 2016

2015

The structure of graphs not admitting a fixed immersion.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

An exact characterization of tractable demand patterns for maximum disjoint path problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Immersions in Highly Edge Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

2013

Relationships between Pairs of Representations of Signed Binary Matroids.

[BibT_eX]

[DOI]

Bertrand Guenin

Irene Pivotto

SIAM J. Discret. Math., 2013

2012

Disjoint cycles intersecting a set of vertices.

[BibT_eX]

[DOI]

Matteo Pontecorvi

J. Comb. Theory B, 2012

The Erdős-Pósa property for clique minors in highly connected graphs.

[BibT_eX]

[DOI]

Reinhard Diestel

J. Comb. Theory B, 2012

On the excluded minor structure theorem for graphs of large tree-width.

[BibT_eX]

[DOI]

Reinhard Diestel

Theodor Müller

J. Comb. Theory B, 2012

Finite connectivity in infinite matroids.

[BibT_eX]

[DOI]

Henning Bruhn

Eur. J. Comb., 2012

K_6 minors in large 6-connected graphs

[BibT_eX]

[DOI]

CoRR, 2012

K_6 minors in 6-connected graphs of bounded tree-width

[BibT_eX]

[DOI]

CoRR, 2012

2011

Packing cycles with modularity constraints.

[BibT_eX]

[DOI]

Comb., 2011

A simpler algorithm and shorter proof for the graph minor decomposition.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Finding topological subgraphs is fixed-parameter tractable.

[BibT_eX]

[DOI]

Martin Grohe

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

New Proofs in Graph Minors.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

The Graph Minor Algorithm with Parity Conditions.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Voting in Agreeable Societies.

[BibT_eX]

[DOI]

Am. Math. Mon., 2010

Bridges in Highly Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Packing non-zero A-paths in an undirected model of group labeled graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

A shorter proof of the graph minor algorithm: the unique linkage theorem.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2008

Extremal functions for rooted minors.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

The extremal function for 3-linked graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

A weaker version of Lovász' path removal conjecture.

[BibT_eX]

[DOI]

Orlando Lee

Bruce A. Reed

J. Comb. Theory B, 2008

2006

Proper minor-closed families are small.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Non-zero disjoint cycles in highly connected group labelled graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Extremal Functions for Shortening Sets of Paths.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

2005

Non-zero disjoint cycles in highly connected group labeled graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

An improved linear edge bound for graph linkages.

[BibT_eX]

[DOI]

Eur. J. Comb., 2005

Generation of simple quadrangulations of the sphere.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Sam Greenberg

Catherine S. Greenhill

Brendan D. McKay