Long cycles in hypercubes with distant faulty vertices

MaRDI QIDQ3575453zbMATH OpenFDO

Authors Petr Gregor, Riste Škrekovski

Publication date 27 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1005/0.html

zbMATH Keywords

faulty vertexHamiltonian cyclehypercubelinear codelong cycle

Mathematics Subject Classification ID

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

Recommendations

• Long cycles in hypercubes with optimal number of faulty vertices
• Long paths and cycles in hypercubes with faulty vertices
• Embedded paths and cycles in faulty hypercubes
• Long paths and cycles in faulty hypercubes: existence, optimality, complexity
• Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges

Cited in

(8)

• Long cycles in hypercubes with optimal number of faulty vertices
• Connectivity and edge-bipancyclicity of Hamming shell
• Gray codes with bounded weights
• scientific article; zbMATH DE number 1990668 (Why is no real title available?)
• Hamiltonian cycles in hypercubes with faulty edges
• Hamiltonian laceability of hypercubes without isometric subgraphs
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Long paths and cycles in faulty hypercubes: existence, optimality, complexity

This page was built for publication: Long cycles in hypercubes with distant faulty vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575453)