Random packings of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4134097 (Why is no real title available?)
- scientific article; zbMATH DE number 3710196 (Why is no real title available?)
- 3K2-decomposition of a graph
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- A note on the decomposition of graphs into isomorphic matchings
- Randomly decomposable graphs
- Randomly matchable graphs
Cited in
(18)- Packing trees of unbounded degrees in random graphs
- 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
- Randomly \(P_k\)-decomposable graphs
- Random packing by -connected -regular graphs
- All \(P_{3}\)-equipackable graphs
- Graphs that are randomly packable by some common disconnected graphs
- Random packing by matroid bases and triangles
- All \(M_{2}\)-equicoverable graphs
- \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
- A short update on equipackable graphs
- scientific article; zbMATH DE number 851072 (Why is no real title available?)
- \(M_{2}\)-equipackable graphs
- Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- Randomly H-coverable graphs
- Block allocation of a sequential resource
This page was built for publication: Random packings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322245)
