Results 31 to 40 of about 1,116,443 (297)
A fast algorithm for equitable coloring [PDF]
Combinatorica, 2010 An equitable \(k\)-colouring of a graph is a proper vertex colouring with \(k\) colors, in which the sizes of any two colour classes differ by at most one. It was conjectured by P. Erdős and proved by \textit{A. Hajnal} and \textit{E. Szemerédi} [Combinat. Theory Appl., Colloquia Math. Soc.
Henry A. Kierstead +3 more
openaire +1 more source
Eco-Friendly Dyeing of Viscose Rayon Fabrics Using Anthocyanin from Hibiscus sabdariffa Linn
Journal of Natural Fibers, 2022 This paper investigates the feasibility of dyeing viscose rayon fabric with an anthocyanin solution extracted from H. sabdariffa L. calyces. For eco-friendly dyeing and improvement of the natural dye’s affinity to fabrics, natural mordants instead of ...
Fatemeh Shahmoradi Ghaheh +2 more
doaj +1 more source
Prediction of the Exposure Endpoint of Textile Color Fastness to Light
Journal of Physics, Conference Series, 2022 The color fastness to light of textile in the product standard is always tested by method 3 in GB/T 8427, which determines the endpoint of exposure according to the discoloration of the blue wool standard sample.
Huanhuan Zhang, Yijing Huang, Wei Zhou
semanticscholar +1 more source
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance [PDF]
Journal of Graph Algorithms and Applications, 2006 Summary: We study the following optimization problem: the input is a multigraph \(G = (V, E)\) and an integer parameter \(g\). A feasible solution consists of a (not necessarily proper) coloring of E with colors \(1, 2, \cdots, g\). Denote by \(d(v, i)\) the number of edges colored \(i\) incident to \(v\). The objective is to minimize \(\sum_{v \in V} \
Gruia Calinescu, Michael J. Pelsmajer
openaire +2 more sources
Coloring Fast Without Learning Your Neighbors' Colors
CoRR, 2020 We give an improved randomized CONGEST algorithm for distance-$2$ coloring that uses $Δ^2+1$ colors and runs in $O(\log n)$ rounds, improving the recent $O(\log Δ\cdot \log n)$-round algorithm in [Halldórsson, Kuhn, Maus; PODC '20]. We then improve the time complexity to $O(\log Δ) + 2^{O(\sqrt{\log\log n})}$.
Halldórsson, Magnús M. +3 more
openaire +5 more sources
Journal of Natural Fibers, 2023 In this study, we explore the dyeing properties of the extract of sappan wood natural dye for coloration of wool yarn to find the potential use of natural dyed wool yarn in the development of eco-friendly textiles.
Mohammad Nadeem Bukhari +6 more
semanticscholar +1 more source
Polymer Testing, 2022 Poly (2-methyl-1,3-propylene glycol-adipic acid) ester diol (PMA-1000), 2,2-dihydroxymethyl propionic acid (DMPA), toluene diisocyanate (TDI), 1,4-butanediol (BDO), 2,6-diaminoanthraquinone (DAAQ) were used as raw materials, triethylamine (TEA) as ...
Jia Zhao +4 more
doaj +1 more source
Involvement of silver and palladium with red peanuts skin extract for cotton functionalization
Scientific Reports, 2023 A systematic study is currently demonstrated approach for approving the superior role of silver and palladium metallic particles in acting the role of mordant with acquiring the dyed cotton fabrics excellence in color fastness with additional functions ...
Hossam E. Emam +3 more
doaj +1 more source
Journal of Natural Fibers, 2017 Environmental issues inspire the revival of natural dyes that exhibit better biodegradability and more compatibility over synthetic ones. This research is aimed to investigate the effect of color and fastness properties on wool yarn substrate with ...
Mohd Yusuf +3 more
doaj +1 more source
Fast Coloring Despite Congested Relays.
CoRR, 2023 We provide a $O(\log^6 \log n)$-round randomized algorithm for distance-2 coloring in CONGEST with $Δ^2+1$ colors. For $Δ\gg\operatorname{poly}\log n$, this improves exponentially on the $O(\logΔ+\operatorname{poly}\log\log n)$ algorithm of [Halldórsson, Kuhn, Maus, Nolin, DISC'20].
Maxime Flin +2 more
openaire +4 more sources