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 cycle; generalized de Bruijn and Kautz digraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

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

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