Decomposing a graph into pseudoforests with one having bounded degree
Under an Elsevier user license
open archive
Keywords
Decomposition of graphs
Maximum average degree of a graph
Maximum outdegree of an oriented graph
Pseudoforest
Nine Dragon Tree Conjecture
Cited by (0)
- 2
Currently at: Center for Combinatorics, LPMC–TJKLC, Nankai University, Tianjin 300071, China.
Copyright © 2015 Elsevier Inc. All rights reserved.