Shifted de Bruijn graphs
DOI10.1007/978-3-319-17296-5_20zbMATH Open1327.05154OpenAlexW2292869200MaRDI QIDQ3460465FDOQ3460465
Authors: Ragnar Freij-Hollanti
Publication date: 7 January 2016
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17296-5_20
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Complexity of the hamiltonian cycle in regular graph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized de Bruijn cycles
- Title not available (Why is that?)
- Succinct de Bruijn graphs
- Number of cycles in the graph of 312-avoiding permutations
Cited In (1)
This page was built for publication: Shifted de Bruijn graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460465)