Hamiltonicity of large generalized de Bruijn cycles
From MaRDI portal
Publication:2446865
Recommendations
Cites work
- Design to Minimize Diameter on Building-Block Network
- Digraphs. Theory, algorithms and applications
- Disjoint paths of bounded length in large generalized cycles
- Eulerian and Hamiltonian dicycles in directed hypergraphs
- Generalized de Bruijn digraphs
- Handbook of product graphs
- scientific article; zbMATH DE number 4204369 (Why is no real title available?)
- scientific article; zbMATH DE number 1286212 (Why is no real title available?)
- Large generalized cycles
- On the connectivity of generalized p-cycles.
- On the superconnectivity of generalized \(p\)-cycles
- The Hamiltonian property of consecutive-\(d\) digraphs
- The Hamiltonian property of generalized de Bruijn digraphs
- The Hamiltonian property of linear functions
- The Hamiltonian property of the consecutive-3 digraphs
Cited in
(6)- The Hamiltonian property of generalized de Bruijn digraphs
- Distance domination of generalized de Bruijn and Kautz digraphs
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- The diameter and Hamiltonian cycle of the generalized de Bruijn graphs \(UG_{\text{B}}(n,n(n+1))\)
- scientific article; zbMATH DE number 27748 (Why is no real title available?)
- scientific article; zbMATH DE number 167887 (Why is no real title available?)
This page was built for publication: Hamiltonicity of large generalized de Bruijn cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446865)