On DRC‐covering of Kn by cycles

DOI10.1002/jcd.10040zbMath1031.05101OpenAlexW1973315577MaRDI QIDQ4800406

Jean-Claude Bermond, Min-Li Yu, David Coudert

Publication date: 3 April 2003

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.10040

zbMATH Keywords

cycle coverdisjoint routing constraint

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

The spectrum of optimal excess graphs for trees with up to four edges ⋮ Virtual network embedding in the cycle ⋮ On DRC-covering ofλ-fold complete graphs ⋮ Traffic grooming in bidirectional WDM ring networks

This page was built for publication: On DRC‐covering of K_n by cycles