333 citations · 441 across the 12 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
On the chromatic number of some ()-free graphs
Rui Li, Jinfeng Li, Di Wu
A hereditary class of graphs is {\em -bounded} if there is a {\em -binding function}, say , such that for every , where …
math.CO2023
A tight linear chromatic bound for ()-free graphs
Rui Li, Jinfeng Li, Di Wu
For two vertex disjoint graphs and , we use to denote the graph with vertex set and edge set , and use to denote the graph wit…
math.CO2023
Optimal chromatic bound for (, house)-free graphs
Rui Li, Di Wu, Jinfeng Li
Let and be two vertex disjoint graphs. The {\em union} is the graph with and . We use to denote a {\em…