Hamiltonian cycles in k‐partite graphs
From MaRDI portal
Publication:5110679
DOI10.1002/jgt.22508zbMath1495.05162arXiv1707.07633OpenAlexW2991258747MaRDI QIDQ5110679
Dan Pritikin, Eli Thompson, Louis DeBiasio, Robert A. Krueger
Publication date: 21 May 2020
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07633
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ On Hamiltonian cycles in balanced \(k\)-partite graphs ⋮ Chorded pancyclicity in \(k\)-partite graphs ⋮ Finding long cycles in balanced tripartite graphs: a first step ⋮ Powers of Hamiltonian cycles in multipartite graphs
This page was built for publication: Hamiltonian cycles in k‐partite graphs
