Covering a Graph by Forests and a Matching

DOI10.1137/100818340zbMath1237.05164arXiv1007.0316OpenAlexW2080706144MaRDI QIDQ3225156

Mickaël Montassier, Tomáš Kaiser, Andre Raspaud

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0316

zbMATH Keywords

decompositionmatchingforestfractional arboricity

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Decomposing 4-connected planar triangulations into two trees and one path ⋮ Degree Bounded Forest Covering ⋮ Decomposing a graph into forests and a matching

This page was built for publication: Covering a Graph by Forests and a Matching