Arboricity and spanning‐tree packing in random graphs
From MaRDI portal
(Redirected from Publication:4642744)
Recommendations
- Packing arborescences in random digraphs
- Packing arborescences in random digraphs
- Arboricity and spanning-tree packing in random graphs with an application to load balancing
- Packing trees of unbounded degrees in random graphs
- scientific article; zbMATH DE number 19179
- Packing tree factors in random and pseudo-random graphs
- Arboricity and tree-packing in locally finite graphs
- scientific article; zbMATH DE number 747032
- Spanning trees in random graphs
- Spanning trees in randomly perturbed graphs
Cited in
(11)- Packing arborescences in random digraphs
- Edge-disjoint spanning trees and forests of graphs
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs
- Lattices over Bass rings and graph agglomerations
- scientific article; zbMATH DE number 19179 (Why is no real title available?)
- Packing tree factors in random and pseudo-random graphs
- Packing arborescences in random digraphs
- scientific article; zbMATH DE number 841622 (Why is no real title available?)
- scientific article; zbMATH DE number 866660 (Why is no real title available?)
- Packing trees of unbounded degrees in random graphs
- Arboricity and spanning-tree packing in random graphs with an application to load balancing
This page was built for publication: Arboricity and spanning‐tree packing in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642744)