Tree Decomposition of Graphs

Random Structures and Algorithms

Volumn 12, Issue 3, 1998, Pages 237-251

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Decomposition; Trees

Indexed keywords

EID: 0032387781     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199805)12:3<237::AID-RSA2>3.0.CO;2-W     Document Type: Article

References (8)

1. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley & Sons, New York, 1991.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, 1976.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990.
4. D. Dor and M. Tarsi, Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proceedings of the Twentieth ACM STOC, ACM Press, 1992, pp. 252-263.
5. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
6. T. Gustavsson, Decompositions of large graphs and digraphs with high minimum degree, Doctoral dissertation, Department of Mathematics, University of Stockholm, 1991.
7. C. St. J. A. Nash-Williams, An unsolved problem concerning decomposition of graphs into triangles, in Combinatorial Theory and Its Applications III, P. Erdös, P. Rényi, and V. T. Sós, Eds., North Holland, 1970, pp. 1179-1183.
8. R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium XV, 1975, pp. 647-659.