
An improved procedure for colouring graphs of bounded local density
We develop an improved bound for the chromatic number of graphs of maxim...
read it

An algorithmic framework for colouring locally sparse graphs
We develop an algorithmic framework for graph colouring that reduces the...
read it

Structure and colour in trianglefree graphs
Motivated by a recent conjecture of the first author, we prove that ever...
read it

Strong chromatic index and Hadwiger number
We investigate the effect of a fixed forbidden clique minor upon the str...
read it

Occupancy fraction, fractional colouring, and triangle fraction
Given ε>0, there exists f_0 such that, if f_0 < f <Δ^2+1, then for any g...
read it

Colouring trianglefree graphs with local list sizes
We prove two distinct and natural refinements of a recent breakthrough r...
read it

Bipartite induced density in trianglefree graphs
Any trianglefree graph on n vertices with minimum degree at least d con...
read it

Treelike distance colouring for planar graphs of sufficient girth
Given a multigraph G and a positive integer t, the distancet chromatic ...
read it

Least conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment...
read it

Separation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of li...
read it
Ross J. Kang
is this you? claim profile