Packing sequences

DOI10.1016/0097-3165(84)90003-7zbMATH Open0531.05019OpenAlexW4212862480MaRDI QIDQ787987FDOQ787987

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

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

Cites Work

• Title not available (Why is that?)
• Packing trees in complete graphs
• Balanced integer arrays: a matrix packing theorem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Packing analogue of \(k\)-radius sequences
• Recursive sequences in the Ford sphere packing
• Packing of graphs - a survey
• Title not available (Why is that?)

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)