On the chromatic number of $$P_5$$-free graphs with no large intersecting cliques

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path

(2023) Alex Scott et al.   COMBINATORICA

On graphs with no induced five‐vertex path or paraglider

(2021) Shenwei Huang et al.   JOURNAL OF GRAPH THEORY

Coloring graphs with no induced five‐vertex path or gem

(2020) Maria Chudnovsky et al.   JOURNAL OF GRAPH THEORY

Polynomial $$\chi $$χ-Binding Functions and Forbidden Induced Subgraphs: A Survey

(2019) Ingo Schiermeyer et al.   GRAPHS AND COMBINATORICS

Perfect divisibility and 2-divisibility

(2018) Maria Chudnovsky et al.   JOURNAL OF GRAPH THEORY

Chromatic bounds for some classes of 2K2-free graphs

(2018) T. Karthick et al.   DISCRETE MATHEMATICS

On the chromatic number of 2K2-free graphs

(2018) Christoph Brause et al.   DISCRETE APPLIED MATHEMATICS

Chromatic number of P5-free graphs: Reed’s conjecture

(2016) Ingo Schiermeyer   DISCRETE MATHEMATICS

Vizing Bound for the Chromatic Number on Some Graph Classes

(2015) T. Karthick et al.   GRAPHS AND COMBINATORICS

The chromatic number of{P5,K4}-free graphs

(2013) Louis Esperet et al.   DISCRETE MATHEMATICS