scientific article; zbMATH DE number 1300357

MaRDI QIDQ4248910zbMATH OpenFDO

Authors

Publication date 10 June 1999

zbMATH Keywords

matchingHamiltonian graphrandomly packable graphspackable trees

Mathematics Subject Classification ID

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

Recommendations

• Random packings of graphs
• Graphs that are randomly packable by some common disconnected graphs
• scientific article; zbMATH DE number 5665909
• scientific article; zbMATH DE number 5287650

Cited in

(13)

• Packing trees of unbounded degrees in random graphs
• scientific article; zbMATH DE number 4109789 (Why is no real title available?)
• Perfect packings in quasirandom hypergraphs. I.
• scientific article; zbMATH DE number 5665909 (Why is no real title available?)
• Packing tree factors in random and pseudo-random graphs
• Perfect Packings in Quasirandom Hypergraphs II
• Randomly \(P_k\)-decomposable graphs
• Random packing by -connected -regular graphs
• Between packable and arbitrarily packable graphs: Packer-spoiler games
• Graphs that are randomly packable by some common disconnected graphs
• scientific article; zbMATH DE number 851072 (Why is no real title available?)
• Randomly H-coverable graphs
• Block allocation of a sequential resource

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 Q4248910)