scientific article; zbMATH DE number 1463392

MaRDI QIDQ4487451zbMATH OpenFDO

Authors Barbara Maenhaut

Publication date 13 February 2001

zbMATH Keywords

5-cyclecomplete graphpacking

Mathematics Subject Classification ID

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

Recommendations

• Packing pentagons into complete graphs: How clumsy can you get?
• scientific article; zbMATH DE number 1332102
• scientific article; zbMATH DE number 4099341
• scientific article; zbMATH DE number 1228445

Cited in

(7)

• Packing pentagons into complete graphs: How clumsy can you get?
• A catalogue of nonisomorphic 5-homogeneous pentagonal 5-packings
• Nesting and almost resolvability of pentagon systems
• scientific article; zbMATH DE number 4099341 (Why is no real title available?)
• scientific article; zbMATH DE number 1228445 (Why is no real title available?)
• scientific article; zbMATH DE number 1332102 (Why is no real title available?)
• scientific article; zbMATH DE number 786154 (Why is no real title available?)

This page was built for publication:

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