Note on Choudum's “chromatic bounds for a class of graphs”
Medha Javdekar · Journal of Graph Theory · 1980
Abstract If a graph G has no induced subgraph isomorphic to K1,3′ K5‐e, or a third graph that can be selected from two specific graphs, then the chromatic number of G is either d or d + 1, where d is the maximum order of a clique in G.