On maximal t-packings of the complete multipartite graph

DOI10.1515/DMA.1998.8.2.143MaRDI QIDQ4522787zbMATH OpenOpenAlexFDO

Authors S. G. Sal'nikov

Publication date 4 January 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1998.8.2.143

zbMATH Keywords

complete graphmultipartite graphpacking

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1156587
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
• scientific article; zbMATH DE number 3889575
• Maximum number of vertex-disjoint complete subgraphs
• scientific article; zbMATH DE number 2192081

Cited in

(5)

• An isoperimetric lemma
• Weakly union-free maximum packings
• scientific article; zbMATH DE number 3889575 (Why is no real title available?)
• Maximum number of vertex-disjoint complete subgraphs
• scientific article; zbMATH DE number 1156587 (Why is no real title available?)

This page was built for publication: On maximal t-packings of the complete multipartite graph

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