mycoreobjectrosdok_document_0000028037rosdok_document_0000028037rosdokdocumentrosdok_derivate_00002299382026-10-21T12:13:01.665Z2026-10-21T12:09:23.730ZMCRJANITOReditorKEpublished1rosdok_derivate_0000229938truetruederivate_types:fulltextVolltextfulltextwf_edit_epub wf_register_epubstate:publishedstate:publishedveröffentlichtpublishedrosdok_id00005900198726469XOau2026-10-212026-10-21T12:11:02ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperOrthogonal double covers of complete Graphs by fat caterpillarsAn 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.DaliborFroncekVerfasserInaut1300123190000-0003-4528-2059UweLeck1969 -VerfasserInaut123092418https://purl.uni-rostock.de/rosdok/id00005900urn:nbn:de:gbv:28-rosdok_id00005900-710.18453/rosdok_id00005900510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (6 Seiten)2005University of Rostock, Institute of MathematicsRostockmonographic20052026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005900Dalibr Froncek,Uwe Leckrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-805/10005-0001doctype:epubdoctype:epubDokumenttypDocument typedoctype:epub.workingpaperdoctype:epub.workingpaperWorkingpaperworking paperdiniPublType:workingPaper diniPublType2022:WorkingPaperinfo:eu-repo/semantics/workingPaperdocumentdiniPublType2022:WorkingPaperdiniPublType2022:WorkingPaperArbeitspapierWorking paperKDSF (Pu37)SDNB:510SDNB:510510 Mathematik510 Mathematicsinstitution:unirostockinstitution:unirostockUniversität RostockUniversity of RostockUniversität RostockUniversität RostockUni.Rostockhttp://d-nb.info/gnd/38329-6institution:unirostock.mnfinstitution:unirostock.mnfMathematisch-Naturwissenschaftliche FakultätFaculty of Mathematics and Natural SciencesUniversität Rostock. Mathematisch-Naturwissenschaftliche FakultätMathematisch-Natur-<br />wissenschaftliche FakultätUni.Rostock.Fakultaet.MNFhttp://d-nb.info/gnd/2147083-2licenseinfo:worklicenseinfo:workWerkworklicenseinfo:work.rightsreservedlicenseinfo:work.rightsreservedalle Rechte vorbehaltenall rights reserved/creativecommons/r/reserved/0.9/88x31.png[DE-28]Urheberrechtsschutz 1.0$gRights Statements$uhttp://rightsstatements.org/vocab/InC/1.0/http://rightsstatements.org/vocab/InC/1.0/http://rightsstatements.org/vocab/InC/1.0/licenseinfo:depositlicenseinfo:depositVeröffentlichungsgenehmigungpermission to storelicenseinfo:deposit.rightsunirostocklicenseinfo:deposit.rightsunirostockRechteinhaber Universität Rostockrightsholder Rostock Universityaccesscondition:openaccessaccesscondition:openaccessfrei zugänglich (Open Access)open accesshttp://purl.org/coar/access_right/c_abf2OAfreeinfo:eu-repo/semantics/openAccess[DE-28]Open Access$gControlled Vocabulary for Access Rights$uhttp://purl.org/coar/access_right/c_abf2licenseinfo:metadatalicenseinfo:metadataLizenzen für Metadatenlicenseinfo:metadata.cc0licenseinfo:metadata.cc0Lizenz Metadaten: CC0license metadata: CC0/creativecommons/p/zero/1.0/88x31.pnghttps://creativecommons.org/publicdomain/zero/1.0/rfc5646:enrfc5646:enEnglischEnglishengengOrthogonal double covers of complete Graphs by fat caterpillarsOrthogonal double covers of complete Graphs by fat caterpillarsgnd:130012319orcid:0000-0003-4528-2059gnd:123092418gnd:130012319orcid:0000-0003-4528-2059gnd:123092418rosdok_document_0000028037-d3976595e49gnd:130012319orcid:0000-0003-4528-2059Dalibor FroncekDalibor Froncekrosdok_document_0000028037-d3976595e63gnd:123092418Uwe LeckUwe LeckDalibor FroncekUwe LeckDalibor FroncekUwe LeckDalibor FroncekUwe LeckRostockUniversity of Rostock, Institute of Mathematicsepub.workingpaperhttps://purl.uni-rostock.de/rosdok/id00005900urn:nbn:de:gbv:28-rosdok_id00005900-710.18453/rosdok_id00005900An 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.20052005Preprints aus dem Institut für Mathematikrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-805/10005-0001https://purl.uni-rostock.de/rosdok/id000058163255797-8Dalibr Froncek,Uwe Leckepub.workingpaper1 Froncek_orthogonal_2005.pdf 127170 568d19debcef1674a54dfedd5d3f8510 rosdok_id00005900198726469XOau2026-10-212026-10-21T12:11:02ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperOrthogonal double covers of complete Graphs by fat caterpillarsAn 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.DaliborFroncekVerfasserInaut1300123190000-0003-4528-2059UweLeck1969 -VerfasserInaut123092418https://purl.uni-rostock.de/rosdok/id00005900urn:nbn:de:gbv:28-rosdok_id00005900-710.18453/rosdok_id00005900510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (6 Seiten)2005University of Rostock, Institute of MathematicsRostockmonographic20052026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005900Dalibr Froncek,Uwe Leckrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-805/10005-0001 2026-10-21T12:09:23.730Z 2026-10-21T12:13:01.665Z 2026-10-31T12:13:01.678Z editorKE {"identifier":"rosdok/id00005900","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-21T12:09:23.740Z"} {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005900-7","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-21T12:09:23.749Z"} {"identifier":"https://purl.uni-rostock.de/rosdok/id00005900","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-21T12:09:23.756Z","registrationStarted":"2026-10-21T12:13:00.362Z"} {"identifier":"10.18453/rosdok_id00005900","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-21T12:09:23.761Z","registrationStarted":"2026-10-21T12:13:00.130Z","registered":"2026-10-21T12:13:01.663Z"} MCRJANITORfulltextfile/rosdok_document_0000028037/rosdok_derivate_0000229938/Froncek_orthogonal_2005.pdfOrthogonal double covers of complete Graphs by fat caterpillarsOrthogonal double covers of complete Graphs by fat caterpillarsgnd:130012319orcid:0000-0003-4528-2059gnd:123092418gnd:130012319orcid:0000-0003-4528-2059gnd:123092418rosdok_document_0000028037-d3976595e49gnd:130012319orcid:0000-0003-4528-2059Dalibor FroncekDalibor Froncekrosdok_document_0000028037-d3976595e63gnd:123092418Uwe LeckUwe LeckDalibor FroncekUwe LeckDalibor FroncekUwe LeckDalibor FroncekUwe LeckRostockUniversity of Rostock, Institute of Mathematicsepub.workingpaperhttps://purl.uni-rostock.de/rosdok/id00005900urn:nbn:de:gbv:28-rosdok_id00005900-710.18453/rosdok_id00005900An 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.20052005Preprints aus dem Institut für Mathematikrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-805/10005-0001https://purl.uni-rostock.de/rosdok/id000058163255797-8Dalibr Froncek,Uwe Leck[xslt]Saxonrosdok_id00005900https://purl.uni-rostock.de/rosdok/id00005900198726469X10.18453/rosdok_id00005900urn:nbn:de:gbv:28-rosdok_id00005900-7Dalibor Froncek, Uwe LeckFroncek Dalibor, Leck UweOrthogonal double covers of complete Graphs by fat caterpillarsWorkingpaperworking paperUniversity of Rostock, Institute of Mathematics, 2005An 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…rosdok_id000058160005-000105/1Dalibor FroncekUwe LeckOrthogonal double covers of complete Graphs by fat caterpillarsPreprints aus dem Institut für MathematikUniversitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005900DaliborFroncekVerfasserInaut1300123190000-0003-4528-2059UweLeck1969 -VerfasserInaut123092418[purl]https://purl.uni-rostock.de/rosdok/id00005900[urn]urn:nbn:de:gbv:28-rosdok_id00005900-7[doi]10.18453/rosdok_id00005900open_access20052005epoch:21th_centuryrfc5646:endoctype:epub.workingpaperaccesscondition:openaccessSDNB:510institution:unirostock.mnfstate:published