Packings by Complete Bipartite Graphs
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (2) , 199-209
- https://doi.org/10.1137/0607024
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Packings by cliques and by finite families of graphsDiscrete Mathematics, 1984
- On factors with given componentsDiscrete Mathematics, 1982
- Testing Deadlock-Freedom of Computer SystemsJournal of the ACM, 1980
- A matching problem with side conditionsDiscrete Mathematics, 1980
- An extension of Tutte's 1-factor theoremDiscrete Mathematics, 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
- A Theorem on k-Saturated GraphsCanadian Journal of Mathematics, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952
- Reguläre Faktoren von Graphen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1950
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947