Constructing Optimal $k$-Radius Sequences

DOI10.1137/15M1023506zbMath1338.68226WikidataQ62595906 ScholiaQ62595906MaRDI QIDQ2797088

Adrian Bondy, Paweł Rzążewski, Zbigniew Lonc

Publication date: 4 April 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-radius sequences\(k\)-additive sequences\(k\)-perfect sequencessequentially additive labelings of graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Extremal set theory (05D05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (4)

Erratum: Constructing Optimal $k$-Radius Sequences ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Sequences of radius \(k\) for complete bipartite graphs ⋮ Note on a construction of short \(k\)-radius sequences

Cites Work

• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Sequences of large radius
• Simply sequentially additive labelings of 2-regular graphs
• Sequentially additive graphs
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Consecutive storage of relevant records with redundancy
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

This page was built for publication: Constructing Optimal $k$-Radius Sequences