In this paper, we are interested in some problems related to chromatic n...
For a graph G, let χ(G) (ω(G)) denote its chromatic (clique)
number. A P...
For a graph G, χ(G) will denote its chromatic number, and ω(G)
its cliqu...
A 4-wheel is the graph consisting of a chordless cycle on four vertices
...
We show that every connected induced subgraph of a graph G is dominated ...
Given two graphs H_1 and H_2, a graph is (H_1, H_2)-free if it
contains ...
For a graph G, let χ(G) and ω(G) respectively denote the
chromatic numbe...
We elucidate the structure of (P_6,C_4)-free graphs by showing that ever...
The computational complexity of the Vertex Coloring problem is known for...