Results 71 to 80 of about 2,394 (219)
Generalized chromatic polynomials
Discrete Mathematics, 1984 In the study of combinatorics there are several polynomials used including Birkhoff's chromatic polynomial for graphs, the study of Stanley's order polynomial for partially ordered sets and Tutte's dichromatic polynomial for graphs. The author develops a common basis for these polynomials.
openaire +2 more sources
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 +4 more
wiley +1 more source
To realisation of chromatic polynomial calculation algorithm [PDF]
, 2019 We calculate chromatic polynomial of an undirected graph using the fundamental reduction theorem and reducing to complete graphs. We also find the chromatic number using the chromatic polynomial.
Stankov, I. S., Statkevich, V. M.
core
Certificates of Factorisation for Chromatic Polynomials
The Electronic Journal of Combinatorics, 2009 The chromatic polynomial gives the number of proper $\lambda$-colourings of a graph $G$. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if $P({G},\lambda)=P({H_{1}},\lambda)P({H_{2 ...
Kerri Morgan, Graham Farr
openaire +2 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 +7 more
wiley +1 more source
, 2020 Ovaj završni rad bavi se kromatskim polinomom koji je nastao u pokušaju dokazivanja teorema o četiri boje. Definirat ćemo kromatski broj i kromatski polinom te navesti njihova osnovna svojstva.
Runtić, David
core
Algebraic aspects of the chromatic polynomial
, 2017 The chromatic polynomial P(G, λ) gives the number of proper colourings of a graph G in at most λ colours. Although there has been considerable interest in the chromatic polynomial, there has been little research into its algebraic theory.
Morgan, Kerri Jo-Anne (3634525)
core +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