20 citations · 118 across the 29 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 3 cited
Forcing clique immersions through chromatic number
Gregory Gauthier, Tien-Nam Le, Paul Wollan
Building on recent work of Dvořák and Yepremyan, we show that every simple graph of minimum degree contains as an immersion and that every graph with chromatic number…
math.CO2017★ 5 cited
Chi-boundedness of graph classes excluding wheel vertex-minors
Hojin Choi, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there exists a function such that for every graph in the class and an induced subgraph of , if …
math.CO2017★ 2 cited
Nonrepetitive colourings of graphs excluding a fixed immersion or topological minor
Paul Wollan, David R. Wood
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if is a fixed planar graph that has a planar embeddi…