Note on Choudum's “chromatic bounds for
✍
Medha Javdekar
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 105 KB
## Abstract If a graph __G__ has no induced subgraph isomorphic to __K__~1,3′~ __K__~5~‐__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__.