Welcome to Journal of Beijing Institute of Technology
Volume 14Issue 4
.
Turn off MathJax
Article Contents
GOU Kui-xiang, SUN Liang. On the {P2,P3}-Factor of Cubic Graphs[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2005, 14(4): 445-448.
Citation: GOU Kui-xiang, SUN Liang. On the {P2,P3}-Factor of Cubic Graphs[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2005, 14(4): 445-448.

On the {P2,P3}-Factor of Cubic Graphs

  • Received Date:2004-03-03
  • Let G=(V,E) be a finite simple graph and P ndenote the path of order n. A spanning subgraph F is called a {P 2,P 3}-factor of G if each component of F is isomorphic to P 2or P 3. With the path-covering method, it is proved that any connected cubic graph with at least 5 vertices has a {P 2,P 3}-factor F such that |P 3(F)|≥|P 2(F)|, where P 2(F) and P 3(F) denote the set of components of P 2and P 3in F, respectively.
  • loading
  • [1]
    A ndo K, Egaw a Y.Path factors in claw free gr aphs[J]. Discr ete M athematics, 2002, 243(2):195-200.
    [2]
    A kiyama J, A vis D, Era H.On a{1, 2}factor of ag raph[J]. T RU M at h, 1980, 16(1):97-102.
    [3]
    A kiyama J, U rr utia J.Simple alternating pat h problems[J]. Discr ete M athematics, 1990, 84(2):101-103.
    [4]
    A nanchun N, Saito A.Facto r criticality and completeclosure of graphs[J]. Discrete M athematics, 2003, 265(1):13-21.
    [5]
    Chen Yaoyun, T ian Feng, Wei Bing.Degrees sums andpath factor in graphs[J]. Gr aphs and Combinatorics, 2001, 17(1):61-71.
  • 加载中

Catalog

    通讯作者:陈斌, bchen63@163.com
    • 1.

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (136) PDF downloads(2) Cited by()
    Proportional views
    Related

    /

      Return
      Return
        Baidu
        map