Orthogonal double covers of complete Graphs by fat caterpillars

Dalibor Froncek; Uwe Leck

doi:10.18453/rosdok_id00005900

zum übergeordneten Dokument

Dalibor Froncek Uwe Leck

Orthogonal double covers of complete Graphs by fat caterpillars

University of Rostock, Institute of Mathematics, 2005

https://doi.org/10.18453/rosdok_id00005900

Abstract: 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.

Workingpaper Freier Zugang

Titel:

Orthogonal double covers of complete Graphs by fat caterpillars

Schriftenreihe:

Preprints aus dem Institut für Mathematik, 05/1

Beteiligte Personen:

Dalibor Froncek[VerfasserIn]
	0000-0003-4528-2059
	130012319
Uwe Leck[VerfasserIn]
	123092418

Zusammenfassung:

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. [Englisch]

Dokumenttyp:

Workingpaper

Einrichtung:

Mathematisch-Naturwissenschaftliche Fakultät

Sprache:

Englisch

Sachgruppe der DNB:

510 Mathematik

Umfang:

1 Online-Ressource (6 Seiten)

Veröffentlichung /
Entstehung:

Rostock: University of Rostock, Institute of Mathematics