PL EN

Preferencje
Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Czasopismo

## Discussiones Mathematicae Graph Theory

2008 | 28 | 3 | 551-556
Tytuł artykułu

### Path and cycle factors of cubic bipartite graphs

Autorzy
Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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.
Słowa kluczowe
EN
Kategorie tematyczne
Wydawca
Czasopismo
Rocznik
Tom
Numer
Strony
551-556
Opis fizyczny
Daty
wydano
2008
otrzymano
2006-12-28
poprawiono
2008-06-27
zaakceptowano
2008-06-27
Twórcy
autor
• Department of Computer and Information Sciences, Ibaraki University, Hitachi 316-8511, Japan
autor
• Department of Mathematics, University of Seoul, Dongdaemoonku, Seoul 130-743, Korea
autor
• Department of Computer and Information Sciences, Ibaraki University, Hitachi 316-8511, Japan
Bibliografia
• [1] J. Akiyama and M. Kano, Path factors of a graph, Graphs and applications (Boulder, Colo., 1982), 1-21, Wiley-Intersci. Publ., Wiley, New York, 1985.
• [2] A. Kaneko, A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two, J. Combin. Theory (B) 88 (2003) 195-218, doi: 10.1016/S0095-8956(03)00027-3.
• [3] M. Kano, G.Y. Katona and Z. Király, Packing paths of length at least two, Discrete Math. 283 (2004) 129-135, doi: 10.1016/j.disc.2004.01.016.
• [4] K. Kawarabayashi, H. Matsuda, Y. Oda and K. Ota, Path factors in cubic graphs, J. Graph Theory 39 (2002) 188-193, doi: 10.1002/jgt.10022.
• [5] J. Petersen, Die Theorie der regulären Graphen, Acta Math. 15 (1891) 193-220, doi: 10.1007/BF02392606.
Typ dokumentu
Bibliografia
Identyfikatory