×

On orthogonal double covers of graphs. (English) Zbl 1001.05091

An orthogonal double cover (ODC) of the complete graph \(K_n\) is a collection of \(n\) spanning subgraphs (pages) of \(K_n\) such that they cover every edge of the complete graph precisely twice and the intersection of every two pages contains exactly one edge. If all the pages are isomorphic to some graph \(G\), then \(K_n\) has an ODC by \(G\). This paper is a thorough survey of results on ODCs. Some generalizations of the problem are also covered. The list of references contains 67 items.

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B05 Combinatorial aspects of block designs
PDFBibTeX XMLCite
Full Text: DOI