scientific article
From MaRDI portal
Publication:3575463
zbMath1192.94070MaRDI QIDQ3575463
Darko Dimitrov, Tomáš Dvořák, 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/1310/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Paths and cycles (05C38) Information theory (general) (94A15) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items (9)
Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ Extending perfect matchings to Gray codes with prescribed ends ⋮ Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges ⋮ Towards a problem of Ruskey and Savage on matching extendability ⋮ Matchings extend to Hamiltonian cycles in 5-cube ⋮ Hamiltonian laceability in hypercubes with faulty edges ⋮ Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution ⋮ Hamiltonian cycles in hypercubes with faulty edges ⋮ Small matchings extend to Hamiltonian cycles in hypercubes
This page was built for publication: