Pages that link to "Item:Q1584282"
From MaRDI portal
The following pages link to On embedding complete graphs into hypercubes (Q1584282):
Displaying 15 items.
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- Fixed hypercube embedding (Q1108043) (← links)
- On embedding of a hypercube in a completely overlapping network (Q2272202) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- Bounded complete embedding graphs (Q2799800) (← links)
- Isometric Embeddings of Subdivided Complete Graphs in the Hypercube (Q3395000) (← links)
- (Q3487362) (← links)
- Isometric embeddings of subdivided complete graphs in the hypercube (Q3503484) (← links)
- (Q3739138) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
- A theorem on graph embedding with a relation to hyperbolic volume (Q5915868) (← links)
- Embeddings of chemical graphs in hypercubes (Q5941990) (← links)