23 citations · 134 across the 40 of their papers we have counts for
54 papers
Properties of -contraction-critical graphs with no minor
Martin Rolek, Zi-Xia Song, Robin Thomas
Motivated by the famous Hadwiger's Conjecture, we study the properties of -contraction-critical graphs with no minor; we prove that every -contraction-critical graph wi…
Five-List-Coloring Graphs on Surfaces: The Many Faces Far-Apart Generalization of Thomassen's Theorem
Luke Postle, Robin Thomas
Let be a plane graph with the boundary of the outer face and let be a family of non-empty sets. By an -coloring of a subgraph of we mean a (pr…
Quickly excluding a non-planar graph
Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph with no minor isomorphic to a fixed graph has a certain structure.…
Packing -paths of length zero modulo a prime
Robin Thomas, Youngho Yoo
It is known that -paths of length mod satisfy the Erdős-Pósa property if or , but not if is composite. We show that if is prime, then -paths of…
Packing cycles in undirected group-labelled graphs
Robin Thomas, Youngho Yoo
We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs where assigns to each edge of an undirected graph an ele…
Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation
Chun-Hung Liu, Robin Thomas
Robertson and Seymour's celebrated Graph Minor Theorem states that graphs are well-quasi-ordered by the minor relation. Unlike the minor relation, the topological minor relation do…