Packing of three copies of a graph

DOI10.1002/(SICI)1097-0118(199601)21:1%3C71::AID-JGT10%3E3.0.CO;2-VMaRDI QIDQ4862111zbMATH OpenOpenAlexFDO

Authors Hong Wang, Norbert Sauer

Publication date 18 August 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199601)21:1%3C71::aid-jgt10%3E3.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)

Recommendations

• Triple placement of graphs
• Packing three copies of a tree into its sixth power
• Packing three copies of a tree into a complete graph
• Packing a number of copies of a \(( p , q )\)-graph
• A note on k-placeable graphs

Cited in

(8)

• Packing three copies of a tree into a complete graph
• A near packing of two graphs
• Pack graphs with subgraphs of size three
• Packing a number of copies of a \(( p , q )\)-graph
• Triple placement of graphs
• scientific article; zbMATH DE number 3871397 (Why is no real title available?)
• A note on k-placeable graphs
• On uniqueness of packing of three copies of 2-factors

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

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