Random packings of graphs

DOI10.1016/0012-365X(94)90142-2zbMath0795.05114MaRDI QIDQ1322245

Peter Hamburger, Lowell W. Beineke, Wayne Goddard

Publication date: 11 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

packingsrandomly packable graphs

Mathematics Subject Classification ID

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

Related Items (9)

All \(M_{2}\)-equicoverable graphs ⋮ A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs ⋮ Random packing by matroid bases and triangles ⋮ Random packing by \(\rho\)-connected \(\rho\)-regular graphs ⋮ A short update on equipackable graphs ⋮ \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs ⋮ All \(P_{3}\)-equipackable graphs ⋮ Randomly \(P_k\)-decomposable graphs ⋮ \(M_{2}\)-equipackable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the decomposition of graphs into isomorphic matchings
• Randomly decomposable graphs
• 3K2-decomposition of a graph
• Randomly matchable graphs
• A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs

This page was built for publication: Random packings of graphs