The following pages link to Random packings of graphs (Q1322245):
Displaying 18 items.
- Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- Randomly \(P_k\)-decomposable graphs (Q713169) (← links)
- Randomly H-coverable graphs (Q792344) (← links)
- All \(P_{3}\)-equipackable graphs (Q960935) (← links)
- Random packing by \(\rho\)-connected \(\rho\)-regular graphs (Q1126281) (← links)
- Graphs that are randomly packable by some common disconnected graphs (Q1286572) (← links)
- Random packing by matroid bases and triangles (Q1901027) (← links)
- All \(M_{2}\)-equicoverable graphs (Q2361091) (← links)
- A short update on equipackable graphs (Q2467992) (← links)
- \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs (Q2476252) (← links)
- \(M_{2}\)-equipackable graphs (Q2499599) (← links)
- (Q3402451) (← links)
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (Q4368813) (← links)
- (Q4867690) (← links)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- Block allocation of a sequential resource (Q5217060) (← links)
- Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges (Q6640964) (← links)
