Variations on the Roy-Gallai theorem (Q816578): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q593274 |
||
| Property / reviewed by | |||
| Property / reviewed by: Gabriel Semanisin / rank | |||
Revision as of 20:40, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variations on the Roy-Gallai theorem |
scientific article |
Statements
Variations on the Roy-Gallai theorem (English)
0 references
9 March 2006
0 references
A generalisation of the classical result by \textit{B. Roy} [Rev. Franç. Inform. Rech. Opér. 1, No. 5, 129--132 (1967; Zbl 0157.31302)] and \textit{T. Gallai} [Theory of graphs, Proc. Colloq. Tihany, Hungary 1966, 115--118 (1968; Zbl 0159.54403)] is presented. The proof of the main result is given by mathematical induction. Some other known results can be obtained as consequence of the new one.
0 references
graph colouring
0 references
chromatic number
0 references
longest path
0 references
panchromatic chain
0 references
stable set
0 references
