Orthogonal double covers of complete Graphs by fat caterpillars Froncek, Dalibor (VerfasserIn) Leck, Uwe , 1969- (VerfasserIn) Text Text 2005 2005 eng electronic resourceremoteComputermedienOnline-Ressource1 Online-Ressource (6 Seiten) An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every Edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n-1 edges. We show that for any given positive integer d, almost all caterpillars of diameter d admit an ODC of the corresponding complete graph.<eng> Open Access Urheberrechtsschutz 1.0 Dalibr Froncek,Uwe Leck 510 https://purl.uni-rostock.de/rosdok/id00005900 Orthogonal double covers of complete graphs by fat caterpillars--(DE-627)488257417 urn:nbn:de:gbv:28-rosdok_id00005900-7 doi: 10.18453/rosdok_id00005900 oclc: 1621955869 ppn: (DE-627)198726469X