Hamiltonicity in balanced k-partite graphs
From MaRDI portal
Publication:1900517
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.
Recommendations
- On Hamiltonian cycles in balanced \(k\)-partite graphs
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Hamiltonian cycles in \(k\)-partite graphs
- A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
- The Hamiltonicity of balanced bipartite graphs involving balanced independent set
Cited in
(12)- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
- Chorded pancyclicity in \(k\)-partite graphs
- On Hamiltonian cycles in balanced \(k\)-partite graphs
- Finding long cycles in balanced tripartite graphs: a first step
- Powers of Hamiltonian cycles in multipartite graphs
- Tight cycles in hypergraphs
- scientific article; zbMATH DE number 7366808 (Why is no real title available?)
- Hamiltonian cycles in \(k\)-partite graphs
- Tight cycles and regular slices in dense hypergraphs
- On degree conditions of semi-balanced 3-partite Hamiltonian graphs
- On degree conditions of semi-balanced k-partite Hamiltonian graphs
This page was built for publication: Hamiltonicity in balanced \(k\)-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900517)
