Pages that link to "Item:Q436587"
From MaRDI portal
The following pages link to Embedding of hypercubes into necklace, windmill and snake graphs (Q436587):
Displaying 10 items.
- Bothway embedding of circulant network into grid (Q491606) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Characterization of the congestion lemma on layout computation (Q2051622) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Results on Total Restrained Domination number and subdivision number for certain graphs (Q5069711) (← links)
- (Q5121937) (← links)
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees (Q6094514) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
