scientific article; zbMATH DE number 1300357

zbMATH Open0926.05030MaRDI QIDQ4248910FDOQ4248910

Authors:

Publication date: 10 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

matchingHamiltonian graphrandomly packable graphspackable trees

Mathematics Subject Classification ID

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

Cited In (13)

• Packing trees of unbounded degrees in random graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfect packings in quasirandom hypergraphs. I.
• Perfect Packings in Quasirandom Hypergraphs II
• Packing tree factors in random and pseudo-random graphs
• Randomly \(P_k\)-decomposable graphs
• Between packable and arbitrarily packable graphs: Packer-spoiler games
• Random packing by \(\rho\)-connected \(\rho\)-regular graphs
• Graphs that are randomly packable by some common disconnected graphs
• Title not available (Why is that?)
• 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)