Decomposing a graph into forests

Authors:
Mickael Montassier;Patrice Ossona de Mendez;André Raspaud;Xuding Zhu
Affiliations:
Université Bordeaux 1, LaBRI UMR CNRS 5800, France;Centre dAnalyse et de Mathématique Sociales, CNRS, UMR 8557, 54 Bd Raspail, 75006, Paris, France;Université Bordeaux 1, LaBRI UMR CNRS 5800, France;Department of Mathematics, Zhejiang Normal University, China
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 8
Cited 1

Equilibrium graphs and rational trees

European Journal of Combinatorics
Fractional arboricity, strength, and principal partitions in graphs and matroids

Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
The game coloring number of planar graphs

Journal of Combinatorial Theory Series B
Covering planar graphs with forests

Journal of Combinatorial Theory Series B
Refined activation strategy for the marking game

Journal of Combinatorial Theory Series B
Decomposing a planar graph with girth 9 into a forest and a matching

European Journal of Combinatorics
Edge-partitions of planar graphs and their game coloring numbers

Journal of Graph Theory
Covering planar graphs with forests, one having bounded maximum degree

Journal of Combinatorial Theory Series B

Covering a Graph by Forests and a Matching

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The fractional arboricity @c"f(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|-1) over all the induced subgraphs G[X] of G. In this paper, we propose a conjecture which says that every graph G with @c"f(G)=0, there is a graph G with @c"f(G)