Tree-Matchings in Graph Processes
From MaRDI portal
Publication:3971235
Recommendations
Cited in
(8)- Tilings in randomly perturbed dense graphs
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Perfect matchings in random intersection graphs
- Packing tree factors in random and pseudo-random graphs
- Nonvertex-balanced factors in random graphs
- Multitrees in random graphs
- On resilience of connectivity in the evolution of random graphs
- Matching and covering the vertices of a random graph by copies of a given graph
This page was built for publication: Tree-Matchings in Graph Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971235)