Decomposing a graph into forests - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2012

Decomposing a graph into forests

Résumé

In this paper, we propose a conjecture which says that every graph $G$ with $\gamma_f(G) \le k+ \frac{d}{k+d+1}$ decomposes into $k+1$ forests, and one of the forests has maximum degree at most $d$. We prove two special cases of this conjecture: If $G$ is a graph with fractional arboricity at most $\frac 43$, then $G$ decomposes into a forest and a matching. If $G$ is a graph with fractional arboricity at most $\frac 32$, then $G$ decomposes into a forest and a linear forest. In particular, every planar graph of girth at least $8$ decomposes into a forest and a matching, and every planar graph of girth at least $6$ decomposes into a forest and a linear forest. This improves earlier results concerning decomposition of planar graphs. We give examples to show that there are planar graphs of girth $7$ which does not decompose into a forest and a matching, and there are planar graphs of girth $5$ which does not decompose into a forest and a linear forest. We also show that the bound in the conjecture above is sharp, i.e., for any $\epsilon > 0$, there is a graph $G$ with $\gamma_f(G) < k+ \frac{d}{k+d+1} +\epsilon$, and yet $G$ cannot be decomposed into $k+1$ forests, with one of them having maximum degree at most $d$.

Dates et versions

hal-00656800 , version 1 (05-01-2012)

Identifiants

Citer

Mickael Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu. Decomposing a graph into forests. Journal of Combinatorial Theory, Series B, 2012, 102 (1), pp.38-52. ⟨10.1016/j.jctb.2011.04.001⟩. ⟨hal-00656800⟩

Collections

CNRS EHESS ANR
100 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More