Packings by Complete Bipartite Graphs
From MaRDI portal
Publication:3728943
DOI10.1137/0607024zbMath0597.05050MaRDI QIDQ3728943
Pavol Hell, David G. Kirkpatrick
Publication date: 1986
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0607024
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Unnamed Item, On the use of augmenting chains in chain packings, A parameter linked with \(G\)-factors and the binding number, On the tree packing problem, Generalized partitions of graphs, Optimal packing of induced stars in a graph, Maximum tree-packing in time \(O(n^{5/2})\), On the complexity of some edge-partition problems for graphs, Rounding in symmetric matrices and undirected graphs