Packing sequences

DOI10.1016/0097-3165(84)90003-7zbMath0531.05019OpenAlexW4212862480MaRDI QIDQ787987

Arthur M. Hobbs

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90003-7

zbMATH Keywords

sequences(0,1)-matricespacking of trees into \(K_ n\)

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Packing of graphs - a survey

Cites Work

• Packing trees in complete graphs
• Balanced integer arrays: a matrix packing theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing sequences