Proof of Locke's conjecture. I

MaRDI QIDQ5269419zbMATH OpenFDO

Authors Nelson Castañeda, Ivan S. Gotchev

Publication date 16 June 2017

Full work available at URL http://pjm.ppu.edu/sites/default/files/papers/PJM_April_2017_0.pdf

zbMATH Keywords

Hamiltonian cycleHamiltonian pathhypercube

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Hamiltonicity of hypercubes with faulty vertices
• Path coverings with prescribed ends in faulty hypercubes
• Hamiltonian laceability of hypercubes with faults of charge one
• Hamiltonian laceability of hypercubes without isometric subgraphs
• Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes

Cited in

(3)

• Path coverings with prescribed ends in faulty hypercubes
• Hamiltonian laceability of hypercubes with faults of charge one
• Hamiltonian laceability of hypercubes without isometric subgraphs

This page was built for publication: Proof of Locke's conjecture. I

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