|
|||||
|
|
A characterisation of rigid circuit graphs |
|
| Authors: | Peter Buneman |
| Institution: | School of Artificial Intelligence, Edinburgh University, Scotland, UK |
| Abstract: | Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then Gn contains a vertex of degree not exceeding n(3r?7)/(3r?4). The result is essentially best possible. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |