Hamiltonicity in balanced \(k\)-partite graphs (Q1900517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hamiltonicity in balanced \(k\)-partite graphs |
scientific article; zbMATH DE number 811342
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonicity in balanced \(k\)-partite graphs |
scientific article; zbMATH DE number 811342 |
Statements
Hamiltonicity in balanced \(k\)-partite graphs (English)
0 references
29 November 1995
0 references
Let \(G\) denote a balanced \(k\)-partite graph with \(kn\) nodes. The authors show that \(G\) contains a hamiltonian cycle if its minimum node-degree exceeds \((k/2- 1/(k+ 1))n\) or \((k/2- 2/(k+ 2))n\), according as \(k\) is odd or even.
0 references
hamiltonicity
0 references
balanced \(k\)-partite graph
0 references
hamiltonian cycle
0 references
