Arboricity and spanning‐tree packing in random graphs

DOI10.1002/rsa.20743zbMath1387.05238OpenAlexW2516383456WikidataQ57991405 ScholiaQ57991405MaRDI QIDQ4642744

Pu Gao, Cristiane M. Sato, Xavier Pérez-Giménez

Publication date: 25 May 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20743

zbMATH Keywords

random graphsload balancingarboricityspanning tree packing

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

Lattices over Bass rings and graph agglomerations ⋮ Packing Arborescences in Random Digraphs ⋮ Rainbow monochromatic \(k\)-edge-connection colorings of graphs

This page was built for publication: Arboricity and spanning‐tree packing in random graphs