Packing sequences

DOI10.1016/0097-3165(84)90003-7MaRDI QIDQ787987zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Packing graphs with odd and even trees
• Packing almost stars into the complete graph
• scientific article; zbMATH DE number 1022391
• scientific article; zbMATH DE number 22649
• scientific article; zbMATH DE number 4145943

Cites work

• scientific article; zbMATH DE number 3732107 (Why is no real title available?)
• scientific article; zbMATH DE number 3604921 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• Balanced integer arrays: a matrix packing theorem
• Packing trees in complete graphs

Cited in

(5)

• Packing of graphs - a survey
• scientific article; zbMATH DE number 1714654 (Why is no real title available?)
• Packing analogue of \(k\)-radius sequences
• scientific article; zbMATH DE number 4051348 (Why is no real title available?)
• Recursive sequences in the Ford sphere packing

This page was built for publication: Packing sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787987)