Hits :

Author : Daqing Yang

Date of Publication : 2018-01-01

Journal : Journal of Combinatorial Theory, Series B

Affiliation of Author(s) : 数理与信息工程学院

Volume : Vol.131

Page Number : 40-54

ISSN : 0095-8956

Key Words : Graph;Decomposition;of;a;graph;Arboricity;Fractional;arboricity;Nine;Dragon;Tree;(NDT);Conjecture

Abstract : The fractional arboricity of a graph G, denoted by γ f ( G ) , is defined as γ f ( G ) = max H ⊆ G , v ( H ) > 1 e ( H ) v ( H ) − 1 . The famous Nash-Williams\' Theorem states that a graph G can be partitioned into at most k forests if and only if γ f (

Translation or Not : no