On a generalization of a theorem of Nash-Williams (Q1179465): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(91)90088-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030154415 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3921262 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3703921 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long paths and large cycles in finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5628163 / rank | |||
Normal rank |
Latest revision as of 12:47, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a generalization of a theorem of Nash-Williams |
scientific article |
Statements
On a generalization of a theorem of Nash-Williams (English)
0 references
26 June 1992
0 references
Let \(G\) be a simple \(k\)-connected graph with \(\nu\geq 3\) vertices, minimum degree \(\delta\) and independence number \(\alpha\). The paper presents an alternative proof of the following theorem of Fraisse (1986): \(G\), as above, is Hamiltonian if \(\delta\geq\max\{\alpha+k-2,\;(1/(k+1))(\nu+k(k-1))\}\).
0 references
theorem of Nash-Williams
0 references
Hamiltonian
0 references
minimum degree
0 references
independence number
0 references