Packings by cliques and by finite families of graphs
- 1 March 1984
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 49 (1) , 45-59
- https://doi.org/10.1016/0012-365x(84)90150-x
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Packings by Complete Bipartite GraphsSIAM Journal on Algebraic Discrete Methods, 1986
- On the Complexity of General Graph Factor ProblemsSIAM Journal on Computing, 1983
- Packing subgraphs in a graphOperations Research Letters, 1982
- On generalized matching problemsInformation Processing Letters, 1981
- A matching problem with side conditionsDiscrete Mathematics, 1980
- A primal algorithm for optimum matchingPublished by Springer Nature ,1978
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947