Pages that link to "Item:Q1369751"
From MaRDI portal
The following pages link to Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network (Q1369751):
Displaying 21 items.
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes (Q516839) (← links)
- On a hypercube coloring problem (Q703683) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- Silver cubes (Q1014825) (← links)
- Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs (Q1274997) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- Graph 2-rankings (Q1733856) (← links)
- New bounds on a hypercube coloring problem. (Q1853150) (← links)
- A channel assignment problem for optical networks modelled by Cayley graphs (Q1884990) (← links)
- An optimal square coloring of planar graphs (Q1928491) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges (Q2385484) (← links)
- New results on two hypercube coloring problems (Q2446885) (← links)
- Injective coloring of graphs revisited (Q2689514) (← links)
- Two coloring problems on matrix graphs (Q2821120) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
