#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2011

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Zemin Jin, Shili Wen, Shujun Zhou
- Discrete Mathematics
- 2012

- Shili Wen, Peipei Zhu
- 2011

An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. The monochromatic tree partition number of an redge-colored graph G is defined to be the minimum positive integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In this… (More)

- ‹
- 1
- ›