نتایج جستجو برای: colorful and dynamic attraction
تعداد نتایج: 16895011 فیلتر نتایج به سال:
An edge-coloring of a connected graph is monochromatically-connecting if there is a monochromatic path joining any two vertices. How “colorful” can a monochromatically-connecting coloring be? Let mc(G) denote the maximum number of colors used in a monochromatically-connecting coloring of a graph G. We prove some nontrivial upper and lower bounds for mc(G) and relate it to other graph parameters...
Department of Mathematics, Department of Economics, and Center for the Study of Rationality, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel. e-mail: [email protected] web page: http://www.ma.huji.ac.il/hart Department of Mathematics and Center for the Study of Rationality, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel. e-mail: [email protected] Department of Mathe...
We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size si ∈ [0, 1] and a color ci ∈ C, where C is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a ...
Colorful nanofibrous membranes have attracted much attention for their visual varieties and various functionalities. In this article, a colored solution electrospinning process was used to fabricate colorful hydrophobic poly(vinyl butyral) (PVB)/cationic dye nanofibrous membranes (NFMs) successfully. The color and morphology of these as-spun nanofibrous membranes have been analyzed by colorimet...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید