Results 151 to 160 of about 1,320 (180)

Effect of olive paste pH during malaxation on virgin olive oil properties. [PDF]

Sci Rep
Özkılıç SY, Öztürk EN, Altınpulluk SB, Arslan D.   +3 more
europepmc   +1 more source

Temporal vision adaptation and restoration in achromatopsia. [PDF]

iScience
McKyton A, Bick A, Elul D, Abulafia R, Marks Ohana D, Nahmany E, Banin E, Levin N.   +7 more
europepmc   +1 more source

Electronics-Free Visual Monitoring of Dry Eye Disease-Related Tear Biomarkers Using Smart Scleral Lenses. [PDF]

Adv Sci (Weinh)
Wang Z, Park SM, Meyer D, Lee SA, Dai Y, Yu T, Park T, Li F, Jedlicka JG, Long TM, Oladele OT, Shaw GC, Park SA, Kollbaum PS, Kim YL, Lee CH.   +15 more
europepmc   +1 more source

Anti-Interference Spectral Confocal Sensors Based on Line Spot. [PDF]

Sensors (Basel)
Wang B, Li J, Luo M, Liang F, Hu J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the chromatic polynomial of a graph

Mathematical Programming, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AVIS D., DE SIMONE C., NOBILI, Paolo
openaire   +6 more sources

Extended Chromatic Polynomials

Canadian Journal of Mathematics, 1972
Let G be a finite graph with non-empty vertex set (G) and edge set (G) (see [2]). Let λ be a positive integer. Tutte [5] defines a λ-colouring of G as a mapping of (G) into the set Iλ = {1, 2, 3, …, λ} with the property that two ends of any edge are mapped onto distinct integers.
Sobczyk, Andrew, Gettys, James O. jun.
openaire   +1 more source

Cutpoints and the chromatic polynomial

Journal of Graph Theory, 1984
AbstractWe prove that the multiplicity of the root 1 in the chromatic polynomial of a simple graph G is equal to the number of nontrivial blocks in G. In particular, a connected simple graph G has a cutpoint if and only if its chromatic polynomial is divisible by (λ – 1)2.
Earl Glen Whitehead Jr., Lian-Chang Zhao
openaire   +2 more sources

Chromatic Polynomials and the Symmetric Group

Graphs and Combinatorics, 2004
The author gives a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations and introduces a combinatorially defined polynomial associated to a directed graph. He proves that it is related to the chromatic polynomials.
openaire   +1 more source

Chromatic polynomials and ?-polynomials

Journal of Graph Theory, 1996
openaire   +2 more sources

Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function

Discrete Mathematics, 2020
Philippe Nadeau, Olivier Bernardi
exaly