Graph Packings

Electronic Notes in Discrete Mathematics

Volumn 5, Issue , 2000, Pages 170-173

  Hell, Pavol ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

graph factors; graph packings; Matchings; Tutte type theorems

Indexed keywords

EID: 33746925517     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(05)80154-4     Document Type: Article

References (17)

1. Brewster R., Hell P., Pantel S., Rizzi R., and Yeo A. Path packing in directed graphs. manuscript (1999)
2. Cornuejols G., and Hartvigsen D. An extension of matching theory. J. Combinatorial Th. B 40 (1986) 285-296
3. Cornuejols G., Hartvigsen D., and Pulleyblank W.R. Packing subgraphs in a graph, OR Letters 1 (1982) 139-143
4. Hartvigsen D. The square-free 2-factor problem in bipartite graphs, IP CO (1999) 234-241
5. Hartvigsen D., and Hell P. The k-piece packing problem. manuscript (2000)
6. Hell P., and Kirkpatrick D.G. Scheduling, matching, and colouring. Colloquia Math. Soc. Bolyai 25 (1978) 273-279
7. Hell P., and Kirkpatrick D.G. On the complexity of general graph factor problems. SIAM J. Computing l2 (1983) 601-609
8. Hell P., and Kirkpatrick D.G. Packings by cliques and by finite families of graphs. Discrete Math. 49 (1984) 118-133
9. Hell P., and Kirkpatrick D.G. Packings by complete bipartite graphs. SIAM J. Algebraic and Discrete Math. 7 (1986) 113-129
10. Hell P., Kirkpatrick D.G., Kratochvíl J., and Kříž I. On restricted two-factors. SIAM J. on Discrete Math. 4 (1988) 472-484
11. Hell P., Manoussakis Y., and Tuza Zs. Packing problems in edge-coloured graphs. Discrete Applied Math. 52 (1994) 295-306
12. Kano M., Katona G.Y., and Király Z. On path factors and subfactors of graphs without length one. manuscript (1999)
13. Kaneko A. A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. manuscript (1999)
14. 4-free 2-factors in bipartite graphs. manuscript (1999)
15. D.G. Kirkpatrick and P. Hell -; On the completeness of a generalized matching problem, Proc. Tenth Annual ACM Symposium on Theory of Computing (STOC 1978) 240-245.
16. Loebl M., and Poljak S. Efficient subgraph packing. J. Combinatorial Th. B 59 (1993) 106-121
17. Loebl M., and Poljak S. On matroids induced by packing subgraphs. J. Combinatorial Th. B44 (1988) 338-354