Recommendations
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Algorithm for recognizing Cartesian graph bundles
- Edge-colorability of graph bundles
- Fault-diameter of Cartesian graph bundles
- Mengerian properties, hamiltonicity, and claw‐free graphs
- Multiplicative circulant networks. Topological properties and communication algorithms
- On generalized twisted cubes
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
Cited in
(12)- Plenary Lecture 3: Fault diameters of graph products and bundles
- Mixed fault diameter of Cartesian graph bundles
- Wide-diameter of product graphs
- Graph bundles and Ricci‐flatness
- Mixed fault diameter of Cartesian graph bundles. II.
- Randomly twisted hypercubes
- Topological properties on the diameters of the integer simplex
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- The edge fault-diameter of Cartesian graph bundles
- Wide diameter for two families of interconnection networks
- On strong graph bundles
- Wide diameters of Cartesian product graphs and digraphs
This page was built for publication: Wide diameter of Cartesian graph bundles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973142)
