Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Orthogonal double covers of complete graphs by fat caterpillars

100%

Froncek D., Leck U.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 2

343-349

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Froncek D.

1 Leck U.

1 2006

Wyniki wyszukiwania

Orthogonal double covers of complete graphs by fat caterpillars