Large generalized cycles

DOI10.1016/S0166-218X(98)00120-6MaRDI QIDQ1281389zbMATH OpenFDO

Authors K. Appert

Publication date 31 August 1999

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

Full work available at URL https://doi.org/10.1016/S0166-218X(98)00120-6

zbMATH Keywords

generalized cyclegeneralized de Bruijn and Kautz digraphs

Mathematics Subject Classification ID

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

Recommendations

• Large cycles in generalized Johnson graphs
• scientific article; zbMATH DE number 4016936
• Cycles containing many vertices of large degree
• scientific article; zbMATH DE number 2230942
• On generalized cycloids
• General cyclides
• Long cycles in graphs with large degree sums
• Cycles in graphs of fixed girth with large size
• Long cycles in certain graphs of large degree

Cites work

• A Design for Directed Graphs with Minimum Diameter
• Dense bipartite digraphs
• Design to Minimize Diameter on Building-Block Network
• Generalized de Bruijn digraphs
• scientific article; zbMATH DE number 4059445 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Line Digraph Iterations and the (d, k) Digraph Problem
• Table of large \(({\Delta{}}, D)\)-graphs

Cited in

(19)

• 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.
• On the number of cycles in generalized Kautz 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
• On the connectivity of generalized p-cycles.
• Spanners of de Bruijn and Kautz graphs
• Restricted arc-connectivity of generalized \(p\)-cycles
• Counting small cycles in generalized de Bruijn digraphs
• On Moore bipartite digraphs
• Unilaterally connected large digraphs and generalized cycles
• Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
• Eulerian and Hamiltonian dicycles in directed hypergraphs
• On the weak distance-regularity of Moore-type digraphs
• Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing
• Bounds on the acyclic disconnection of a digraph

This page was built for publication: Large generalized cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281389)