94 citations · 106 across the 9 of their papers we have counts for
5 papers · 1 filter
Edge-colouring and orientations: applications to degree- and -boundedness
Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
We prove a new generalisation of Ramsey's theorem by showing that every -edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph who…
An optimal chromatic bound for (, gem)-free graphs
Arnab Char, T. Karthick
Given a graph , the parameters and respectively denote the chromatic number and the clique number of . A function such t…
On graphs with no induced or
Arnab Char, T. Karthick
In this paper, we are interested in some problems related to chromatic number and clique number for the class of -free graphs, and prove the following. If is…
Optimal chromatic bound for (, )-free graphs
Arnab Char, T. Karthick
For a graph , let () denote its chromatic (clique) number. A is the graph obtained by taking the disjoint union of a two-vertex path and a three-ver…
Coloring of (, -wheel)-free graphs
Arnab Char, T. Karthick
For a graph , denote its chromatic (clique) number. A is the chordless path on five vertices, and a - is the graph consisting of a chordless cycl…