On Hamiltonian circuits and spanning trees of hypercubes
From MaRDI portal
Publication:3333083
DOI10.21136/cpm.1984.108506zbMath0544.05057OpenAlexW1573990427MaRDI QIDQ3333083
Publication date: 1984
Full work available at URL: https://eudml.org/doc/19336
Related Items
Hamiltonian paths with prescribed edges in hypercubes, Spanning multi-paths in hypercubes, A survey of the theory of hypercube graphs, Embedding $m$-quasistars into $n$-cubes, Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges, Embedding ladders and caterpillars into the hypercube, Hamiltonian laceability in hypercubes with faulty edges, Gray codes with bounded weights, On the mutually independent Hamiltonian cycles in faulty hypercubes, Two new classes of trees embeddable into hypercubes, Embedded paths and cycles in faulty hypercubes, Bothway embedding of circulant network into grid, Hamiltonian cycles in hypercubes with faulty edges, Hamiltonian laceability of hypercubes without isometric subgraphs, Generalized Gray codes with prescribed ends, A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges, Embedding a subclass of trees into hypercubes, Disjoint cycles and spanning graphs of hypercubes, Path partitions of hypercubes, Long paths in hypercubes with a quadratic number of faults, Small matchings extend to Hamiltonian cycles in hypercubes, On embedding subclasses of height-balanced trees in hypercubes, Embedding height balanced trees and Fibonacci trees in hypercubes, A note on the cubical dimension of new classes of binary trees, Embedding some hierarchical caterpillars into hypercube, Path coverings with prescribed ends in faulty hypercubes
