|
|||||
|
|
Chromatic number and skewness |
|
| Authors: | Paul C Kainen |
| Institution: | Department of Mathematics, Case Western Reserve University, Cleveland, Ohio 44106 USA |
| Abstract: | In this note, we solve the problem of determing the chromatic number of planar graphs to which a certain number μ of “extra” edges are attached. We obtain a (best-possible) theorem when μ < 2k for every integer k ≥ 3. The statement of the theorem for k = 2 is the Four-Color Conjecture. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |