Sequences of radius \(k\) for complete bipartite graphs

DOI10.1016/j.dam.2017.03.017zbMath1361.05037arXiv1711.05091OpenAlexW2524108521WikidataQ62595900 ScholiaQ62595900MaRDI QIDQ528554

Zbigniew Lonc, Paweł Rzążewski, Michał Dębski

Publication date: 12 May 2017

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

Full work available at URL: https://arxiv.org/abs/1711.05091

zbMATH Keywords

maximum cutbipartite graphs\(k\)-radius sequences

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Sequences of large radius
• Near perfect coverings in graphs and hypergraphs
• The edge Hamiltonian path problem is NP-complete
• Constructing Optimal $k$-Radius Sequences
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Sequences of Radius k for Complete Bipartite Graphs
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
• Harmonious and achromatic colorings of fragmentable hypergraphs