37 citations · 312 across the 39 of their papers we have counts for
4 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 $…
Regular Turán numbers and some Gan-Loh-Sudakov-type problems
Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang
Motivated by a Gan-Loh-Sudakov-type problem, we introduce the regular Turán numbers, a natural variation on the classical Turán numbers for which the host graph is required to be r…
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…