Skip to main content
SpringerLink
Log in

Connected Factors and Spanning Trees in Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let G be a graph, and g, f, f′ be positive integer-valued functions defined on V(G). If an f′-factor of G is a spanning tree, we say that it is f′-tree. In this paper, it is shown that G contains a connected (g, f+f′−1)-factor if G has a (g, f)-factor and an f′-tree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Information Sciences, College of Science and Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki-gun, Saitama 350-0394, Japan e-mail: tokuda@j.dendai.ac.jp, , , , , , JP

    Taro Tokuda

  2. Institute of Policy and Management, Chinese Academy Sciences, Beijing 100080, China e-mail: xbg@mail.casipm.ac.cn, , , , , , CN

    Baoguang Xu

  3. Institute of Applied Mathematics, Chinese Academy Sciences, Beijing 100080, China, , , , , , CN

    Jianfang Wang

Authors
  1. Taro Tokuda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baoguang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianfang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October 30, 2000 Final version received: August 20, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tokuda, T., Xu, B. & Wang, J. Connected Factors and Spanning Trees in Graphs. Graphs and Combinatorics 19, 259–262 (2003). https://doi.org/10.1007/s00373-002-0497-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0497-5

Search

Navigation