A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
| Autor: | Victor Bryant |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Discrete mathematics
Fáry's theorem Strong perfect graph theorem Robertson–Seymour theorem Theoretical Computer Science Brooks' theorem Combinatorics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Perfect graph Robbins' theorem Discrete Mathematics and Combinatorics Mirsky's theorem Closed graph theorem Mathematics |
| Zdroj: | Discrete Mathematics. 158:279-281 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/0012-365x(95)00082-8 |
| Popis: | A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem, usually dealt with in two cases, is in fact covered by one of the cases. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect