Robin Thomas

J. Comb. Theory B, January, 2024

2023

Packing cycles in undirected group-labelled graphs.

[BibT_eX]

[DOI]

Youngho Yoo

J. Comb. Theory B, July, 2023

Packing A-paths of length zero modulo a prime.

[BibT_eX]

[DOI]

Youngho Yoo

J. Comb. Theory B, May, 2023

Properties of 8-contraction-critical graphs with no K7 minor.

[BibT_eX]

[DOI]

Martin Rolek

Zi-Xia Song

Eur. J. Comb., May, 2023

On 2-cycles of graphs.

[BibT_eX]

[DOI]

Sergey Norin

Hein van der Holst

J. Comb. Theory B, 2023

2022

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

2021

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

2020

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Quickly excluding a non-planar graph.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Excluded minors in cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Excluding subdivisions of bounded degree graphs.

[BibT_eX]

[DOI]

Chun-Hung Liu

J. Comb. Theory B, 2019

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

The extremal functions for triangle-free graphs with excluded minors.

[BibT_eX]

[DOI]

Youngho Yoo

Eur. J. Comb., 2019

Girth Six Cubic Graphs Have Petersen Minors.

[BibT_eX]

[DOI]

Comb., 2019

The Extremal Function for Bipartite Linklessly Embeddable Graphs.

[BibT_eX]

[DOI]

Rose McCarty

Comb., 2019

2018

Four Edge-Independent Spanning Trees.

[BibT_eX]

[DOI]

Alexander Hoyer

SIAM J. Discret. Math., 2018

Five-list-coloring graphs on surfaces III. One list of size one and one list of size two.

[BibT_eX]

[DOI]

J. Comb. Theory B, 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

Non-embeddable extensions of embedded minors.

[BibT_eX]

[DOI]

Rajneesh Hegde

J. Comb. Theory B, 2018

Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

2017

Cyclically five-connected cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Minors of two-connected graphs of large path-width.

[BibT_eX]

[DOI]

Thanh N. Dang

CoRR, 2017

2016

Deploying Robots With Two Sensors in K1, 6-Free Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Odd K3, 3 subdivisions in bipartite graphs.

[BibT_eX]

[DOI]

Peter Whalen

J. Comb. Theory B, 2016

Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Non-planar extensions of subdivisions of planar graphs.

[BibT_eX]

[DOI]

Sergey Norin

J. Comb. Theory B, 2016

Three-edge-colouring doublecross cubic graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Hyperbolic families and coloring graphs on surfaces.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 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

List-coloring apex-minor-free graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Sub-exponentially many 3-colorings of triangle-free planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Testing first-order properties for subclasses of sparse graphs.

[BibT_eX]

[DOI]

J. ACM, 2013

Odd K_3, 3 subdivisions in bipartite graphs.

[BibT_eX]

[DOI]

Peter Whalen

CoRR, 2013

Arrangeability and Clique Subdivisions.

[BibT_eX]

[DOI]

Vojtech Rödl

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Nested cycles in large triangulations and crossing-critical graphs.

[BibT_eX]

[DOI]

César Hernández-Vélez

Gelasio Salazar

J. Comb. Theory B, 2012

Five-coloring graphs on the Klein bottle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 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

Three-coloring triangle-free planar graphs in linear time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Large non-planar graphs and an application to crossing-critical graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Minor-minimal non-projective planar graphs with an internal 3-separation.

[BibT_eX]

[DOI]

Arash Asadi

Electron. Notes Discret. Math., 2011

Minor-Minimal Planar Graphs of Even Branch-Width.

[BibT_eX]

[DOI]

Torsten Inkmann

Comb. Probab. Comput., 2011

Edge-coloring series-parallel multigraphs

[BibT_eX]

[DOI]

Cristina G. Fernandes

CoRR, 2011

Packing directed circuits exactly.

[BibT_eX]

[DOI]

Bertrand Guenin

Comb., 2011

2010

Voting in Agreeable Societies.

[BibT_eX]

[DOI]

Am. Math. Mon., 2010

K4-free graphs with no odd holes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Deciding First-Order Properties for Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Arash Asadi

Electron. Notes Discret. Math., 2009

Coloring triangle-free graphs on surfaces.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Kt Minors in Large t-Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

The extremal function for 3-linked graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Minimally non-Pfaffian graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Six-Critical Graphs on the Klein Bottle.

[BibT_eX]

[DOI]

Jan Kyncl

Bernard Lidický

Electron. Notes Discret. Math., 2008

Pfaffian labelings and signs of edge colorings.

[BibT_eX]

[DOI]

Comb., 2008

Coloring even-faced graphs in the torus and the Klein bottle.

[BibT_eX]

[DOI]

Comb., 2008

2007

Generating bricks.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

2006

The extremal function for K9 minors.

[BibT_eX]

[DOI]

Zi-Xia Song

J. Comb. Theory B, 2006

Minimal bricks.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Proper minor-closed families are small.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Independent sets in triangle-free cubic planar graphs.

[BibT_eX]

[DOI]

Christopher Carl Heckman

J. Comb. Theory B, 2006

The Circular Chromatic Index of Flower Snarks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Hamilton paths in toroidal graphs.

[BibT_eX]

[DOI]

Wenan Zang

J. Comb. Theory B, 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

Discret. Math., 2005

2004

On possible counterexamples to Negami's planar cover conjecture.

[BibT_eX]

[DOI]

Petr Hlinený

J. Graph Theory, 2004

Three-coloring Klein bottle graphs of girth five.

[BibT_eX]

[DOI]

Barrett Walls

J. Comb. Theory B, 2004

2003

Progress on perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2003

Temperely-Lieb Algebras and the Four-Color Theorem.

[BibT_eX]

[DOI]

Louis Kauffman

Comb., 2003

2002

Generating Internally Four-Connected Graphs.

[BibT_eX]

[DOI]

Thor Johnson

J. Comb. Theory B, 2002

2001

Large induced forests in sparse graphs.

[BibT_eX]

[DOI]

Noga Alon

Dhruv Mubayi

J. Graph Theory, 2001

Directed Tree-Width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

A new proof of the independence ratio of triangle-free cubic graphs.

[BibT_eX]

[DOI]

Christopher Carl Heckman

Discret. Math., 2001

2000

Clique Minors in Graphs and Their Complements.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Comb. Theory B, 2000

Excluding Minors In Nonplanar Graphs Of Girth At Least Five.

[BibT_eX]

[DOI]

Jan Mcdonald Thomson

Comb. Probab. Comput., 2000

Digraph minors and algorithms (abstract only).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Excluding a Countable Clique.

[BibT_eX]

[DOI]

Reinhard Diestel

J. Comb. Theory B, 1999

List Edge-Colorings of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Martin Juvan

Bojan Mohar

Electron. J. Comb., 1999

Graph Planarity and Related Topics.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997

Five-Connected Toroidal Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory B, 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

Uniqueness of highly representative surface embeddings.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Spanning paths in infinite planar graphs.

[BibT_eX]

[DOI]

Nathaniel Dean

J. Graph Theory, 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

On the Genus of a Random Graph.

[BibT_eX]

[DOI]

Vojtech Rödl

Random Struct. Algorithms, 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

1994

Planar Separators.

[BibT_eX]

[DOI]

Noga Alon

SIAM J. Discret. Math., 1994

4-Connected Projective-Planar Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Quickly Excluding a Planar Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Call Routing and the Ratcatcher.

[BibT_eX]

[DOI]

Comb., 1994

1993

Graph Searching and a Min-Max Theorem for Tree-Width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Typical Subgraphs of 3- and 4-Connected Graphs.

[BibT_eX]

[DOI]

Bogdan Oporowski

James G. Oxley

J. Comb. Theory B, 1993

Hadwiger's conjecture for K 6-free graphs.

[BibT_eX]

[DOI]

Comb., 1993

1992

Monochromatic Vs multicolored paths.

[BibT_eX]

[DOI]

Hanno Lefmann

Vojtech Rödl

Graphs Comb., 1992

On the complexity of finding iso- and other morphisms for partial k-trees.

[BibT_eX]

[DOI]

Jirí Matousek

Discret. Math., 1992

1991

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

[BibT_eX]

[DOI]

J. Graph Theory, 1991

The menger-like property of the tree-width of infinite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Quickly excluding a forest.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Algorithms Finding Tree-Decompositions of Graphs.

[BibT_eX]

[DOI]

Jirí Matousek

J. Algorithms, 1991

An end-faithful spanning tree counterexample.

[BibT_eX]

[DOI]

Discret. Math., 1991

Excluding infinite minors.

[BibT_eX]

[DOI]

Discret. Math., 1991

Analyzing Nash-Williams' partition theorem by means of ordinal types.

[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

1990

A menger-like property of tree-width: The finite case.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

On well-quasi-ordering finite structures with labels.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Clique-sums, tree-decompositions and compactness.

[BibT_eX]

[DOI]

Discret. Math., 1990

A Separator Theorem for Graphs with an Excluded Minor and its Applications

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1985

Graphs without K4 and well-quasi-ordering.

[BibT_eX]

[DOI]