Skip to main content
SpringerLink
Log in

Tree decomposition

  • Bulletin
  • Published:
Chinese Science Bulletin

Abstract

A tree decomposition of graphG = (V, E) is referred to as a partition of edge setE into edge-disjoint trees. Given (not necessarily distinct) vertices u1, u2 ⋯ uk∈V with k⩾2, a sufficient and necessary condition is given for a connected graphG = (V, E) to have a tree decompositionT 1,T 2⋯T k such thatV(T 1)=V i,i=1, 2, ⋯ k.

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. Welsh, D. J. A.,Matroid Theory, New York: Academic Press, 1976.

    Google Scholar 

  2. Edmonds, J., Fulkerson, D. R., Transversals and matroid partition,Journal of Research of the National Bureau of Standards, 1965, 69B: 147.

    Google Scholar 

  3. Kampen, G. R., Orienting planar graphs,Discrete Math., 1976, 14: 337.

    Article  Google Scholar 

  4. Ringel, G., Two trees in maximal planar bipartite,J. Graph Theory, 1993, 17: 755.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Science, Chinese Academy of Sciences, 100080, Beijing, China

    Xudong Yuan & Maocheng Cai

Authors
  1. Xudong Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maocheng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Yuan, X., Cai, M. Tree decomposition. Chin. Sci. Bull. 43, 1599–1601 (1998). https://doi.org/10.1007/BF02883401

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation