A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327): Difference between revisions
From MaRDI portal
Created a new Item |
Removed claim: reviewed by (P1447): Item:Q190560 |
||
| Property / reviewed by | |||
| Property / reviewed by: Ioan Tomescu / rank | |||
Revision as of 12:06, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem |
scientific article |
Statements
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (English)
0 references
7 November 1996
0 references
It is proved that for a 2-connected graph \(G\) the following three statements are equivalent: (i) \(G\) is either a complete graph or a cycle; (ii) the removal from \(G\) of any two non-adjacent vertices disconnects it; (iii) the removal from \(G\) of any two vertices of distance 2 apart disconnects it. This produces an algorithmic short proof of Brooks' theorem.
0 references
colouring
0 references
2-connected graph
0 references
Brooks' theorem
0 references
