| title: |
| Orthogonal double covers of complete Graphs by fat caterpillars |
|
| series: |
|
| contributing persons: |
|
| |
| 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.
[English] |
|
| document type: |
|
| institution: |
| Faculty of Mathematics and Natural Sciences |
|
| language: |
|
| subject class (DDC): |
|
| extent: |
|
1 Online-Ressource (6 Seiten)
|
|
| |
publication /
production: |
|
Rostock: University of Rostock, Institute of Mathematics
|
|
2005
|
|
| statement of responsibility: |
|
| |
| identifiers: |
|
| |
| access condition: |
|
| license/rights statement: |
all rights reserved
This work may only be used under the terms of the German Copyright Law (Urheberrechtsgesetz). |
|
|
| RosDok id: |
rosdok_document_0000028037 |
| created / modified: |
21.10.2026 / 21.10.2026
|
| metadata license: |
The metadata of this document was dedicated to the public domain
(CC0 1.0 Universal Public Domain Dedication). |
access
viewer
fulltext