Pages that link to "Item:Q3476279"
From MaRDI portal
The following pages link to Embedding Trees in a Hypercube is NP-Complete (Q3476279):
Displaying 12 items.
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Hypercube embedding heuristics: An evaluation (Q916339) (← links)
- The number of edges in a subgraph of a Hamming graph (Q1600356) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- Subgraphs of hypercubes and subdiagrams of Boolean lattices (Q1815849) (← links)
- Parity and strong parity edge-colorings of graphs (Q1928503) (← links)
- Spanning multi-paths in hypercubes (Q2370445) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)
- A note on the cubical dimension of new classes of binary trees (Q5249653) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
