Large generalized cycles

DOI10.1016/S0166-218X(98)00120-6zbMath0919.05035MaRDI QIDQ1281389

K. Appert

Publication date: 31 August 1999

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

zbMATH Keywords

generalized cyclegeneralized de Bruijn and Kautz digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Spanners of de Bruijn and Kautz graphs ⋮ A proof of Jean de Rumeur's conjecture ⋮ Super link-connectivity of iterated line digraphs. ⋮ Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ On Moore bipartite digraphs ⋮ Unilaterally connected large digraphs and generalized cycles ⋮ A line digraph of a complete bipartite digraph ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Disjoint paths of bounded length in large generalized cycles ⋮ De Bruijn digraphs and affine transformations ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Table of large \(({\Delta{}}, D)\)-graphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Generalized de Bruijn digraphs
• Design to Minimize Diameter on Building-Block Network
• Dense bipartite digraphs

This page was built for publication: Large generalized cycles