Decomposing a graph into pseudoforests with one having bounded degree
The maximum average degree of a graph G , denoted by mad(G), is defined as . Suppose that σ is an orientation of G , Gσ denotes the oriented graph ... Next, we briefly discuss the interesting Nine Dragon Tree (NDT) Conjecture, which leads us to the main r...