Results 91 to 100 of about 568,566 (214)
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 +7 more
wiley +1 more source
A bibliography on chromatic polynomials
Discrete Mathematics, 1997 Our intention is to make this bibliography as complete as possible and as such, some marginally related references are also included.
openaire +2 more sources
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
Journal of Graph Theory, Volume 112, Issue 4, Page 421-432, August 2026.ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) denote the minimum size of a feedback arc set in an oriented multigraph D. In several papers, upper bounds for fas ( D ) were obtained for oriented multigraphs D with maximum degree upper‐bounded by a constant.
Gregory Gutin +3 more
wiley +1 more source
A chromatic partition polynomial
Discrete Mathematics, 1998 Let \(|\pi|\) denote the number of blocks in a partition \(\pi\) of \([n]= \{1,2, \dots, n\}\). Let \(p=a_1 a_2 \dots a_n\) be a permutation of \([n]\). A descent block of \(p\) is a maximal decreasing continuance subword \(a_ia_{i+1} \dots a_j\) of \(p\). The \(n\)th Eulerian polynomial \(A_n(t)\) (for \(n=0,1,2,\dots)\) is defined by \[ \sum_{k\geq 0}
openaire +1 more source
On Oriented Colourings of Graphs on Surfaces
Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley +1 more source
Food Science &Nutrition, Volume 14, Issue 7, July 2026.This study evaluated the efficacy of an ultrasound pre‐treatment applied to a complex cereal–milk infant formula prior to conventional spray drying to mitigate inherent stickiness and yield challenges. Acoustic cavitation (30–90 s) significantly reduced suspension viscosity and improved atomization efficiency, elevating powder recovery yield from 12 ...
Yamen Barakat +2 more
wiley +1 more source
Remote Sensing, 2019 How can the in-flight spectral response functions of a series of decades-old broad band radiometers in Space be retrieved post-flight? This question is the key to developing Climate Data Records from the Meteosat Visible and Infrared Imager on board the ...
Ralf Quast +4 more
doaj +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire +2 more
wiley +1 more source
Algebraic Properties of Chromatic Polynomials and Their Roots
, 2015 In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs.
Gilmore, Hamish Julian
core