Packing of graphs and permutations

MaRDI QIDQ2816146zbMATH OpenFDO

Authors Mariusz Woźniak

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801945?np=y

zbMATH Keywords

packing of graphspermutation structureself-complementary graphs

Mathematics Subject Classification ID

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

Recommendations

• Packing of graphs and permutations -- a survey
• scientific article; zbMATH DE number 1022391
• Packing two graphs of order n having total size at most 2n-2
• On cyclically embeddable graphs
• On cyclically embeddable (n,n)-graphs

Cited in

(7)

• Packing of graphs and permutations -- a survey
• Packing a number of copies of a \(( p , q )\)-graph
• Packing of graphic n-tuples
• Planar packing of cycles and unicyclic graphs
• A note on uniquely embeddable graphs
• scientific article; zbMATH DE number 1022391 (Why is no real title available?)
• On the packing numbers in graphs

This page was built for publication: Packing of graphs and permutations

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