8 citations · 36 across the 26 of their papers we have counts for
5 papers · 1 filter
Structure and colour in triangle-free graphs
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg +3
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number contains a rainbow independent set of size $…
Erdős-Pósa from ball packing
Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer
A classic theorem of Erdős and Pósa (1965) states that every graph has either vertex-disjoint cycles or a set of vertices meeting all its cycles. While the standa…
Large independent sets in triangle-free cubic graphs: beyond planarity
Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret
Every -vertex planar triangle-free graph with maximum degree at most has an independent set of size at least . This was first conjectured by Albertson, Bollobá…
Strong chromatic index and Hadwiger number
Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang +1
We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each that any $K_k…
Strong cliques and forbidden cycles
Wouter Cames van Batenburg, Ross J. Kang, François Pirot
Given a graph , the strong clique number of is the cardinality of a largest collection of edges every pair of which are incident or connected by an edge in . We…