On Hamiltonian circuits and spanning trees of hypercubes
From MaRDI portal
Recommendations
Cited in
(43)- Embedded paths and cycles in faulty hypercubes
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Embedding a subclass of trees into hypercubes
- Two new classes of trees embeddable into hypercubes
- 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
- Hamiltonian laceability in hypercubes with faulty edges
- The number of spanning trees of the generalized Boolean \(n\)-cube network
- Path partitions of hypercubes
- Path coverings with prescribed ends in faulty hypercubes
- Characterisation and classification of signatures of spanning trees of the \(n\)-cube
- Spanning Balanced Trees in Boolean Cubes
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Spanning graphs of hypercubes: Starlike and double starlike trees
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- Gray codes with bounded weights
- A survey of the theory of hypercube graphs
- Embedding some hierarchical caterpillars into hypercube
- Hamiltonian paths with prescribed edges in hypercubes
- On the spanning trees of the hypercube and other products of graphs
- Spanning multi-paths in hypercubes
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- Spanning subgraphs of a hypercube. IV: Rooted trees
- A note on the cubical dimension of new classes of binary trees.
- Spanning trees and domination in hypercubes
- The Hamilton circuit problem on grids
- scientific article; zbMATH DE number 5064035 (Why is no real title available?)
- Disjoint cycles and spanning graphs of hypercubes
- Bothway embedding of circulant network into grid
- Embedding ladders and caterpillars into the hypercube
- Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
- Hamiltonian cycles in hypercubes with faulty edges
- Hamiltonian laceability of hypercubes without isometric subgraphs
- scientific article; zbMATH DE number 5233147 (Why is no real title available?)
- Embedding m-quasistars into n-cubes
- On constructing multiple spanning trees in a hypercube
- scientific article; zbMATH DE number 790411 (Why is no real title available?)
- Generalized Gray codes with prescribed ends
- A spanning tree of the 2^ m-dimensional hypercube with maximum number of degree-preserving vertices
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Long paths in hypercubes with a quadratic number of faults
- New Tricks for Old Trees: Maps and the Pigeonhole Principle
This page was built for publication: On Hamiltonian circuits and spanning trees of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3333083)
