Results 241 to 250 of about 1,128,183 (289)
Synergetic effect of Camellia sinensis waste extract and zinc oxide nanoparticle for improving performance and appearance attributes of viscose fabrics. [PDF]
Rasmy S +3 more
europepmc +1 more source
Sustainable reactive dyeing of polyester/cotton blend fabric via papain enzyme surface modification. [PDF]
Molla WT +4 more
europepmc +1 more source
This paper focused on a novel approach for fastness testing. The changes in color properties of reactive dyed cotton fabrics after different sequential fastness test procedures were investigated.
Behcet Becerir
exaly +3 more sources
In this study, the color and color fastness properties of the dyed plain knitted fabrics made from 50/50 bamboo/cotton blended yarns with three different stitch lengths are investigated in comparison with those of the similar fabrics made from 50/50 ...
Bahar Tiber
exaly +2 more sources
In this study the prints were made on paper substrates, which were thought as map substrate alternatives, with 3 different surface properties at 1200 dpi by using the electrophotographic printing system.
Zafer Ozomay +2 more
exaly +4 more sources
Eleven natural pigments were selected for the production of environment-friendly cotton prints. Physicochemical properties pH, conductivity, viscosity of the printing pastes were measured in order to evaluate their stability and suitability for printing.
Nikolaos Nikolaidis, Eforia Tsatsaroni
exaly +2 more sources
Analysis of Color Fastness and Shrinkage of Dyed and Printed Linen/Silk Fabrics [PDF]
In this study, we analyzed the impact of the dyeing and the digital printing processes of linen/silk fabric (70% linen/30% silk) on its color fastness and shrinkage in the directions of warp and weft.
Egle Kumpikaite +1 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Incidence coloring of Mycielskians with fast algorithm
Theoretical Computer Science, 2021An incidence of an undirected graph \(G\) is a pair \((v,e)\) where \(v\) is a vertex of \(G\) and \(e\) an edge of \(G\) incident with \(v\). Two incidences \((v,e) \) and \((w,f)\) are adjacent if one of the following holds: (i) \(v=w\), (ii) \(e=f\) or (iii) \(vw\in \{e.f\}\). An incidence coloring of \(G\) assigns a color to each incidence of \(G\)
Huimin Bi, Xin Zhang 0017
openaire +2 more sources
A fast parallel algorithm to color a graph with Δ colors
Journal of Algorithms, 1988Summary: An NC algorithm for the \(\Delta\) vertex coloring problem is given. The polynomial algorithm implied by Brooks' theorem seems to be highly sequential. To exploit the power of parallel processing we introduce a novel partition of the graph which may find applications elsewhere.
Mauricio Karchmer, Joseph Naor
openaire +3 more sources

