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 claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434569649 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: The structure of k-chromatic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992558 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three short proofs in graph theory / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:37, 24 May 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
