Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes

DOI10.1007/978-3-642-22616-8_8zbMath1342.68260OpenAlexW2221997056MaRDI QIDQ5199142

Iain A. Stewart

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_8

zbMATH Keywords

Hamiltonian cycles\(k\)-ary \(n\)-cubesprescribed edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes ⋮ Matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes

This page was built for publication: Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes