Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

Path and cycle factors of cubic bipartite graphs

100%

Kano M., Lee C., Suzuki K.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 3

551-556

For a set S of connected graphs, a spanning subgraph F of a graph is called an S-factor if every component of F is isomorphic to a member of S. It was recently shown that every 2-connected cubic graph has a {Cₙ | n ≥ 4}-factor and a {Pₙ | n ≥ 6}-factor, where Cₙ and Pₙ denote the cycle and the path of order n, respectively (Kawarabayashi et al., J. Graph Theory, Vol. 39 (2002) 188-193). In this paper, we show that every connected cubic bipartite graph has a {Cₙ | n ≥ 6}-factor, and has a {Pₙ | n ≥ 8}-factor if its order is at least 8.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Kano M.

1 Lee C.

1 Suzuki K.

1 2008

Wyniki wyszukiwania

Path and cycle factors of cubic bipartite graphs