نتایج جستجو برای: monochromatic
تعداد نتایج: 5210 فیلتر نتایج به سال:
Journal:
:Int. J. Comput. Math.
2004
Zemin Jin
Xueliang Li
Let G be an edge-colored graph. We show in this paper that it is NP-hard to find the minimum number of vertex disjoint monochromatic trees which cover the vertices of the graph G. We also show that there is no constant factor approximation algorithm for the problem unless P = NP. The same results hold for the problem of finding the minimum number of vertex disjoint monochromatic cycles (paths, ...
Journal:
:Journal of Combinatorial Theory, Series B
2013
Journal:
:IEEE Transactions on Nuclear Science
1983
Journal:
:Nano Letters
2018
Journal:
:Bulletin of the Australian Mathematical Society
1999
Journal:
:The Electronic Journal of Combinatorics
2019
Journal:
:Journal of Combinatorial Theory, Series B
1972
Journal:
:Journal of Experimental and Theoretical Physics Letters
2003
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید