Packing of three copies of a graph

DOI<71::AID-JGT10>3.0.CO;2-V 10.1002/(SICI)1097-0118(199601)21:1<71::AID-JGT10>3.0.CO;2-VzbMath0844.05074OpenAlexW4247471725MaRDI QIDQ4862111

Hong Wang, Norbert W. Sauer

Publication date: 18 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199601)21:1<71::aid-jgt10>3.0.co;2-v

zbMATH Keywords

decompositionpackingsubgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Packing a number of copies of a \(( p , q )\)-graph ⋮ A near packing of two graphs

This page was built for publication: Packing of three copies of a graph