Orientations of the n-cube with minimum diameter
From MaRDI portal
Cites work
- Cyclic neofields and combinatorial designs
- scientific article; zbMATH DE number 3710188 (Why is no real title available?)
- scientific article; zbMATH DE number 3794078 (Why is no real title available?)
- On 1-rotational \(S_\lambda(2,3,v)\) designs
- On the existence of 2-designs S₂(2,3,v) without repeated blocks
- Two-fold triple systems without repeated blocks
Cited in
(13)- On a conjecture concerning the orientation number of a graph
- Methods and problems of communication in usual networks
- Optimal orientations of products of paths and cycles
- On optimal orientations of Cartesian products of graphs. I
- On optimal orientations of Cartesian products with a bipartite graph
- A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
- scientific article; zbMATH DE number 5307866 (Why is no real title available?)
- Oriented hypercubes
- The orientation number of two complete graphs with linkages
- Bounds for the oriented diameter of planar triangulations
- On the oriented diameter of planar triangulations
- Cubes and orientability
- Oriented diameter of graphs with diameter 3
This page was built for publication: Orientations of the n-cube with minimum diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916678)