Orthogonal double covers of complete Graphs by fat caterpillars
Froncek, Dalibor
VerfasserIn
aut
Leck, Uwe
1969-
VerfasserIn
aut
text
Text
gw
2005
monographic
XA-DE
Rostock
University of Rostock, Institute of Mathematics
publisher
2005
Rostock
Universitätsbibliothek
distributor
eng
1 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
Rostock : Univ., Fachbereich Mathematik, 2005
Druck-Ausgabe
(DE-627)488257417
Froncek, Dalibor
Preprints aus dem Institut für Mathematik
05/1
urn:nbn:de:gbv:28-rosdok_id00005900-7
10.18453/rosdok_id00005900
1621955869
rda
DE-627
261021
198726469X
20261021T144000.0
Converted from MARCXML to MODS version 3.8 using MARC21slim2MODS3-8_XSLT1-0.xsl
(Revision 1.174 20250328)
ger