Two new classes of trees embeddable into hypercubes
From MaRDI portal
Recommendations
Cites work
- B-valuations of graphs
- Embedding the dichotomic tree into the n-cube
- scientific article; zbMATH DE number 4132179 (Why is no real title available?)
- scientific article; zbMATH DE number 3510332 (Why is no real title available?)
- On cubes and dichotomic trees
- On Hamiltonian circuits and spanning trees of hypercubes
- On quasistars in n-cubes
- One-legged caterpillars span hypercubes
Cited in
(8)- A new proof that two big classes of trees are felicitous trees
- Embeddings Between Hypercubes and Hypertrees
- scientific article; zbMATH DE number 3859148 (Why is no real title available?)
- scientific article; zbMATH DE number 15360 (Why is no real title available?)
- A note on the cubical dimension of new classes of binary trees.
- Embedding a subclass of trees into hypercubes
- Optimal subcube embeddability in hypercubes with additional dimensions
- Optimal layout of embedding onto folded hypercubes
This page was built for publication: Two new classes of trees embeddable into hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693009)