Disjoint paths of bounded length in large generalized cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3340115 (Why is no real title available?)
- A Design for Directed Graphs with Minimum Diameter
- Dense bipartite digraphs
- Design to Minimize Diameter on Building-Block Network
- Diameter vulnerability of iterated line digraphs
- Diameter-vulnerability of large bipartite digraphs
- Large generalized cycles
- Line Digraph Iterations and the (d, k) Digraph Problem
- Maximally connected digraphs
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- On the diameter vulnerability of Kautz digraphs
Cited in
(8)- A unified formulation of Kautz network and generalized hypercube
- Diameter vulnerability of iterated line digraphs in terms of the girth
- An improved bound for disjoint directed cycles
- Super link-connectivity of iterated line digraphs.
- Edge-fault diameter of \(C_4\)-free graphs
- Bounds on the fault-diameter of graphs
- Wide diameter and minimum length of disjoint Menger path systems
- Hamiltonicity of large generalized de Bruijn cycles
This page was built for publication: Disjoint paths of bounded length in large generalized cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292837)