Hamiltonicity in balanced k-partite graphs
From MaRDI portal
Publication:1900517
DOI10.1007/BF01793008zbMATH Open0833.05056OpenAlexW167540395MaRDI QIDQ1900517FDOQ1900517
Authors: Guantao Chen, Ralph Faudree, Ronald Gould, Michael Jacobson, Linda Lesniak
Publication date: 29 November 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01793008
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
Cites Work
Cited In (11)
- Powers of Hamiltonian cycles in multipartite graphs
- Chorded pancyclicity in \(k\)-partite graphs
- Title not available (Why is that?)
- Hamiltonian cycles in \(k\)-partite graphs
- On degree conditions of semi-balanced 3-partite Hamiltonian graphs
- Tight cycles in hypergraphs
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Finding long cycles in balanced tripartite graphs: a first step
- Tight cycles and regular slices in dense hypergraphs
- A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
- On Hamiltonian cycles in balanced \(k\)-partite 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)