Spanning paths in hypercubes

MaRDI QIDQ3576719zbMATH OpenFDO

Authors Tomáš Dvořák, Petr Gregor, Václav Koubek

Publication date 30 July 2010

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

zbMATH Keywords

Hamiltonian pathshypercubespanning pathsvertex fault tolerance

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Spanning multi-paths in hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
• Cycles passing through a prescribed path in a hypercube with faulty edges

Cited in

(13)

• Spanning cubic graph designs
• Symmetric routings of the hypercube
• On paths and cycles dominating hypercubes
• Path coverings with prescribed ends in faulty hypercubes
• Spanning multi-paths in hypercubes
• The path-distance-width of hypercubes
• Routing multiple paths in hypercubes
• Spanning Trees and Domination in Hypercubes
• Path coverings with prescribed ends of the n-dimensional binary hypercube
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Generalized Gray codes with prescribed ends
• Disjoint paths in hypercubes with prescribed origins and lengths
• Path partitions of hypercubes

This page was built for publication: Spanning paths in hypercubes

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