research
∙
08/16/2023
On graphs with no induced P_5 or K_5-e
In this paper, we are interested in some problems related to chromatic n...
share
research
∙
05/16/2022
Optimal chromatic bound for (P_2+P_3, PÌ…_Ì…2Ì…+Ì… Ì…PÌ…_Ì…3Ì…)-free graphs
For a graph G, let χ(G) (ω(G)) denote its chromatic (clique) number. A P...
research
∙
04/06/2021
Coloring graph classes with no induced fork via perfect divisibility
For a graph G, χ(G) will denote its chromatic number, and ω(G) its cliqu...
research
∙
04/03/2020
Wheel-free graphs with no induced five-vertex path
A 4-wheel is the graph consisting of a chordless cycle on four vertices ...
research
∙
07/11/2019
Structural domination and coloring of some (P_7, C_7)-free graphs
We show that every connected induced subgraph of a graph G is dominated ...
research
∙
03/27/2019
On graphs with no induced five-vertex path or paraglider
Given two graphs H_1 and H_2, a graph is (H_1, H_2)-free if it contains ...
research
∙
10/15/2018
Coloring graphs with no induced five-vertex path or gem
For a graph G, let χ(G) and ω(G) respectively denote the chromatic numbe...
research
∙
05/14/2018
Square-free graphs with no six-vertex induced path
We elucidate the structure of (P_6,C_4)-free graphs by showing that ever...
research
∙
09/22/2017
