- Tytuł:
- Orthogonal double covers of complete graphs by fat caterpillars
- Autorzy:
-
Froncek, Dalibor
Leck, Uwe - Powiązania:
- https://bibliotekanauki.pl/articles/743983.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
ODC
orthogonal double cover
graph decomposition
self-orthogonal factorization - Opis:
- An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spanning subgraphs of Kₙ, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kₙ 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2006, 26, 2; 343-349
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł