Skip to main content
SpringerLink
Log in

A note on a spanning 3-tree

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A tree T is called a k-tree, if the maximum degree of T is at most k. In this paper, we prove that if G is an n-connected graph with independence number at most n + m + 1 (n≥1,n≥m≥0), then G has a spanning 3-tree T with at most m vertices of degree 3.

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

References

  1. J. A. Bondy: Basic graph theory — Paths and cycles, Handbook of Combinatorics, Vol. I, Elsevier, Amsterdam (1995), 5–110.

    Google Scholar 

  2. V. Neumann-Lara and E. Rivera-Campo: Spanning trees with bounded degrees, Combinatorica 11(1) (1991), 55–61.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Win: On a conjecture of Las Vergnas concerning certain spanning trees in graphs, Resultate Math. 2 (1979), 215–224.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka Shinjuku-ku, Tokyo, 162-8601, Japan

    Masao Tsugaki

Authors
  1. Masao Tsugaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masao Tsugaki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsugaki, M. A note on a spanning 3-tree. Combinatorica 29, 127–129 (2009). https://doi.org/10.1007/s00493-009-2349-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-009-2349-x

Mathematics Subject Classification (2000)

Search

Navigation