Decomposing hypergraphs into simple hypertrees

Combinatorica

Volumn 20, Issue 1, 2000, Pages 119-140

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034366303     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070036     Document Type: Article

References (9)

1. N. ALON: Decomposition of the complete r-graph into complete r-partite r-graphs, Graphs and Combinatorics, 2 (1986), 95-100.
2. N. ALON and J. H. SPENCER: The Probabilistic Method, John Wiley and Sons Inc., New York, 1991.
3. C. BERGE: Graph and Hypergraphs, North-Holland, Amsterdam, 1973.
4. C. J. COLBOURN and J. H. DINITZ: CRC Handbook of Combinatorial Design, CRC press 1996.
5. D. DOR and M. TARSI: Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proc. 20th ACM STOC, ACM Press (1992), 252-263.
6. V. RÖDL: On a packing and covering problem, European J. Combinatorics, 5 (1985), 69-78.
7. R. M. WILSON: Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium, XV (1975), 647-659.
8. R. YUSTER: Tree decomposition of graphs, Random Structures and Algorithms, 12 (1998), 237-251.
9. R. YUSTER: Packing and decomposition of graphs with trees, J. Combin. Theory Ser. B, to appear.