|
|||||
|
|
A bound on the chromatic number of graphs without certain induced subgraphs |
|
| Authors: | Stanley Wagon |
| Affiliation: | Smith College, Northampton, Massachusetts, 01063 USA |
| Abstract: | For each n, we obtain a (polynomial) bound on the chromatic number in terms of the maximum size of a complete subgraph, for graphs not having n · K2 as an induced subgraph. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |