On the packing of three graphs

DOI10.1016/S0012-365X(00)00443-XzbMath0998.05053OpenAlexW2063205104MaRDI QIDQ5959103

Susan H. Marshall, Jean-François Saclé, Mariusz Woźniak, Hamamache Kheddouci

Publication date: 30 July 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00443-x

zbMATH Keywords

packing of three graphs

Mathematics Subject Classification ID

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

Related Items (4)

A note on \(k\)-placeable graphs ⋮ Packing of graphs and permutations -- a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Labeled packing of cycles and circuits

This page was built for publication: On the packing of three graphs