Graph Packings

Brewster, 1999, Path packing in directed graphs, manuscript Cornuejols, 1986, An extension of matching theory, J. Combinatorial Th. B, 40, 285, 10.1016/0095-8956(86)90085-7 Cornuejols, 1982, Packing subgraphs in a graph, OR Letters, 1, 139 Hartvigsen, 1999, The square-free 2-factor problem in bipartite graphs, IP CO, 234 Hartvigsen, 2000, The k-piece packing problem, manuscript Hell, 1978, Scheduling, matching, and colouring, Colloquia Math. Soc. Bolyai, 25, 273 Hell, 1983, On the complexity of general graph factor problems, SIAM J. Computing, l2, 601 Hell, 1984, Packings by cliques and by finite families of graphs, Discrete Math., 49, 118, 10.1016/0012-365X(84)90150-X Hell, 1986, Packings by complete bipartite graphs, SIAM J. Algebraic and Discrete Math., 7, 113 Hell, 1988, On restricted two-factors, SIAM J. on Discrete Math., 4, 472, 10.1137/0401046 Hell, 1994, Packing problems in edge-coloured graphs, Discrete Applied Math., 52, 295, 10.1016/0166-218X(94)90148-1 Kano, 1999, On path factors and subfactors of graphs without length one, manuscript Kaneko, 1999, 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 Király, 1999, C4-free 2-factors in bipartite graphs, manuscript 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. Loebl, 1993, Efficient subgraph packing, J. Combinatorial Th. B, 59, 106, 10.1006/jctb.1993.1058 Loebl, 1988, On matroids induced by packing subgraphs, J. Combinatorial Th., B44, 338, 10.1016/0095-8956(88)90042-1