The following pages link to The cyclic cutwidth of trees (Q1270769):
Displaying 21 items.
- Embeddings of circulant networks (Q358657) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Multiplicity of finite graphs over the real line (Q743684) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- On spanning tree congestion (Q1044004) (← links)
- The cyclic wirelength of trees (Q1270789) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- Minimal congestion trees (Q1877665) (← links)
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes (Q1887048) (← links)
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans (Q1944166) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- A rigorous proof on circular wirelength for hypercubes (Q2681432) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
