A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 943234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem |
scientific article; zbMATH DE number 943234 |
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
0.7333815097808838
0 references
0.7330837845802307
0 references
0.7321968078613281
0 references
