Disjoint paths of bounded length in large generalized cycles

DOI10.1016/S0012-365X(99)90075-4zbMath0943.05052OpenAlexW4253656615MaRDI QIDQ1292837

Carles Padró, Daniela Ferrero

Publication date: 5 September 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90075-4

zbMATH Keywords

digraphfault tolerancefault diametergeneralized \(p\)-cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

A unified formulation of Kautz network and generalized hypercube ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Super link-connectivity of iterated line digraphs. ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ Diameter vulnerability of iterated line digraphs in terms of the girth

Cites Work

• Unnamed Item
• Unnamed Item
• Large generalized cycles
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Diameter vulnerability of iterated line digraphs
• On the diameter vulnerability of Kautz digraphs
• Diameter-vulnerability of large bipartite digraphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Design to Minimize Diameter on Building-Block Network
• Maximally connected digraphs
• Dense bipartite digraphs

This page was built for publication: Disjoint paths of bounded length in large generalized cycles