|
|||||
|
|
Some graphs with chromatic number three |
|
| Authors: | Jean A Larson |
| Institution: | Department of Mathematics, University of Florida, Gainesville, Florida 32611 USA |
| Abstract: | A question of P. Erdös is solved by showing that certain graphs have chromatic number at most three. The proof proceeds by showing a conjecture of Erdös and Bollobás holds, namely, that under certain circumstances, a graph which contains an odd circuit must contain an odd circuit with diagonal. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |