Skip to main content
Springer Nature Link
Log in

A Sufficient Condition for a Graph to Have a k-tree

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A k-tree of a connected graph is a spanning tree with maximum degree at most k. We obtain a sufficient condition for a graph to have a k-tree, as a generalization of the condition of E. Flandrin, H. A. Jung and H. Li [3] for traceability. We also extend early results of Y. Caro, I. Krasikov and Y. Roditty [2] and Min Aung and Aung Kyaw [4] for the maximal order of a tree with bounded maximum degree in a graph.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 Mathematics, University of Yangon, Yangon 1104, Myanmar, , , , , , BU

    Aung Kyaw

Authors
  1. Aung Kyaw
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: July 28, 1997 Final version received: April 13, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kyaw, A. A Sufficient Condition for a Graph to Have a k-tree. Graphs Comb 17, 113–121 (2001). https://doi.org/10.1007/s003730170059

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170059

Keywords