Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
From MaRDI portal
Publication:1369751
Recommendations
Cited in
(22)- scientific article; zbMATH DE number 2088588 (Why is no real title available?)
- Graph 2-rankings
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
- The chromatic number of the square of the 8-cube
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Injective coloring of graphs revisited
- A distance-labelling problem for hypercubes
- An optimal square coloring of planar graphs
- New results on two hypercube coloring problems
- On a hypercube coloring problem
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
- A channel assignment problem for optical networks modelled by Cayley graphs
- Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
- A coloring problem on the \(n\)-cube
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Two coloring problems on matrix graphs
- New bounds on a hypercube coloring problem.
- Exact distance graphs of product graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Silver cubes
- Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs
This page was built for publication: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369751)
