Sequences of radius for complete bipartite graphs
- 1 July 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 225, 51-63
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Constructing Optimal $k$-Radius SequencesSIAM Journal on Discrete Mathematics, 2016
- Sequences of large radiusEuropean Journal of Combinatorics, 2014
- Constructions of asymptotically shortest k-radius sequencesJournal of Combinatorial Theory, Series A, 2012
- The existence of k-radius sequencesJournal of Combinatorial Theory, Series A, 2012
- Constructing 𝑘-radius sequencesMathematics of Computation, 2011
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequencesMathematics of Computation, 2011
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- The edge Hamiltonian path problem is NP-completeInformation Processing Letters, 1981
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978