Ross J. Kang | DeepAI

DeepAI AI Chat

Featured Co-authors

Stéphan Thomassé
31 publications
Zdeněk Dvořák
23 publications
Louis Esperet
20 publications
François Pirot
13 publications
Ewan Davies
11 publications
Wouter Cames van Batenburg
10 publications
Viresh Patel
10 publications
Hoang La
10 publications
Clément Rambaud
10 publications
N. R. Aravind
8 publications
Lech Duraj
7 publications

∙ 09/12/2023

The χ-binding function of d-directional segment graphs

Given a positive integer d, the class d-DIR is defined as all those inte...

0 Lech Duraj, et al. ∙

∙ 08/28/2023

A precise condition for independent transversals in bipartite covers

Given a bipartite graph H=(V=V_A∪ V_B,E) in which any vertex in V_A (res...

0 Stijn Cambie, et al. ∙

∙ 10/11/2021

Packing list-colourings

List colouring is an influential and classic topic in graph theory. We i...

0 Stijn Cambie, et al. ∙

∙ 07/15/2020

An improved procedure for colouring graphs of bounded local density

We develop an improved bound for the chromatic number of graphs of maxim...

0 Eoin Hurley, et al. ∙

∙ 04/15/2020

An algorithmic framework for colouring locally sparse graphs

We develop an algorithmic framework for graph colouring that reduces the...

0 Ewan Davies, et al. ∙

∙ 12/31/2019

Structure and colour in triangle-free graphs

Motivated by a recent conjecture of the first author, we prove that ever...

0 N. R. Aravind, et al. ∙

∙ 05/15/2019

Strong chromatic index and Hadwiger number

We investigate the effect of a fixed forbidden clique minor upon the str...

0 Wouter Cames van Batenburg, et al. ∙

∙ 12/28/2018

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...

0 Ewan Davies, et al. ∙

∙ 12/04/2018

Colouring triangle-free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough r...

0 Ewan Davies, et al. ∙

∙ 08/07/2018

Bipartite induced density in triangle-free graphs

Any triangle-free graph on n vertices with minimum degree at least d con...

0 Wouter Cames van Batenburg, et al. ∙

∙ 05/06/2018

Tree-like distance colouring for planar graphs of sufficient girth

Given a multigraph G and a positive integer t, the distance-t chromatic ...

0 Ross J. Kang, et al. ∙

∙ 03/29/2018

Least conflict choosability

Given a multigraph, suppose that each vertex is given a local assignment...

0 Zdeněk Dvořák, et al. ∙

∙ 02/11/2018

Separation choosability and dense bipartite induced subgraphs

We study a restricted form of list colouring, for which every pair of li...

0 Louis Esperet, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world