Results 51 to 60 of about 1,320 (180)

Coefficients of chromatic polynomials and tension polynomials

Contributions to Discrete Mathematics, 2011
We evaluate coefficients of chromatic polynomial of a graph G as sums of zero values of tension polynomials of certain "maximal" subgraphs of G.
Martin Kochol, Nad'a Krivonáková
openaire   +1 more source

Enhancing the reliability of skin tone evaluation: A study of full‐face imaging devices with colour calibration

International Journal of Cosmetic Science, EarlyView.
This study offers insights into colour measurement for skin tone evaluation, demonstrating the value of using a ColorChecker and colour calibration to ensure reliable and accurate skin tone measurements. Abstract Background Skin colour measurement is common and essential to clinical evaluation, especially for product efficacy evaluation and research on
Wenyang Wang, Yang Wang, Chanjuan Liu, Andrew Steel, Frédéric Flament   +4 more
wiley   +1 more source

The chromatic sum of a graph: history and recent developments

International Journal of Mathematics and Mathematical Sciences, 2004
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength of a graph is the minimum number of colors necessary to obtain its chromatic sum.
Ewa Kubicka
doaj   +1 more source

New bounds for chromatic polynomials and chromatic roots

Discrete Mathematics, 2015
If $G$ is a $k$-chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$, $π(G,x)$, is at most $x(x-1)\cdots (x-(k-1))x^{n-k} = (x)_{\downarrow k}x^{n-k}$ for every $x\in \mathbb{N}$. We improve here this bound by showing that \[ π(G,x) \leq (x)_{\downarrow k} (x-1)^{Δ(G)-k+1} x^{n-1-Δ(G)}\] for every $x\in \mathbb{N},$ where $
Jason I. Brown, Aysel Erey
openaire   +3 more sources

A systematic color correction pipeline for controlled‐environment imaging

The Plant Phenome Journal, Volume 9, Issue 1, December 2026.
ABSTRACT We present a stepwise color correction (CC) pipeline for controlled imaging environments. The workflow integrates flat‐field correction (FFC), gamma correction, and white‐balance correction, followed by a color‐mapping (CM) stage using machine‐learning regression—linear, partial least squares, and neural networks (NNs)—to deliver reliable CC ...
Collins Wakholi, Michael A. Hardigan, Jungmin Lee, Scott B. Lukas, Max J. Feldman, Kayla R. Altendorf, Jeffrey L. Neyhart, Devin A. Rippner   +7 more
wiley   +1 more source

NIRS Coupled With Machine Learning Algorithms for the Authentication and Quality Assessment of Indigenous Cattle and Buffalo Meat

eFood, Volume 7, Issue 5, October 2026.
Portable NIRS combined with machine learning enabled rapid and accurate authentication of cattle and buffalo meat. Optimized models (XGBoost, CNN) achieved > 98% accuracy, while SHAP revealed key spectral regions. This dual approach offers a field‐ready, reagent‐free tool for fraud prevention and traceability. ABSTRACT Ensuring the authenticity of high‐
Dip Ghosh, Raad Al Deen, Md. Abul Hashem
wiley   +1 more source

Cubical coloring — fractional covering by cuts and semidefinite programming [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings.
Robert Šámal
doaj   +1 more source

Skin Impression Modeling Across Different Skin Types Under Different Scenes

Color Research &Application, Volume 51, Issue 5, September/October 2026.
How do Chinese perceive skin color of different ethnic groups under different shooting and viewing conditions (i.e., illuminance levels, CCTs, scenes and model‐observer familiarity)? ABSTRACT This paper presents a comprehensive study investigating how facial skin colors influence various impressions across different ethnicities and under different ...
Beijia Qin, Yuechen Zhu, Ming Ronnier Luo   +2 more
wiley   +1 more source

Chromatic Polynomials of Fn×P2  Graphs: Algebraic Analysis and Scheduling Applications [version 2; peer review: 2 approved, 1 approved with reservations]

F1000Research
Background Chromatic polynomials are fundamental algebraic invariants in graph theory, linking structural properties of graphs with algebraic and enumerative information.
Sarah M. Talab, Nabeel E. Arif
doaj   +1 more source

Connections between the matching and chromatic polynomials

International Journal of Mathematics and Mathematical Sciences, 1992
The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the matching polynomial of a general complement of a subgraph of a graph.
E. J. Farrell, Earl Glen Whitehead
doaj   +1 more source