Can I read On T-set of T-colorings on EtoBox?
On T-set of T-colorings by Yongqiang Zhao; Wenjie He is a Computer Science article available to read on EtoBox.
What is On T-set of T-colorings about?
Let G be the collection of sets T such that the greedy algorithm obtains the optimal T-span of K n for all n 1, E the collection of sets T such that sp T (G) = sp T (K (G) ) is true for all graphs G. Many families in G or E have been discovered. We know that r-initial set and k multiple of s set are all in G ∩ E. Liu (T-colorings of graphs, Discrete Math. 10 (1992), 203-212) extended k multiple of s set by union with another set S . In this paper, we continue to study the T-set in G and E, extending some T-sets by the similar way.
Who reads On T-set of T-colorings?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Yongqiang Zhao; Wenjie He
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2005
- Language
- EN
- Field
- Computer Science (Physical Sciences)