Results 111 to 120 of about 568,566 (214)

Application of a D‐Optimal Mixture Design for the Development and Optimization of a Pasta Enriched With Pumpkin Products

Journal of Food Science, Volume 91, Issue 6, June 2026.
ABSTRACT Fortification of wheat‐based products with high‐nutritional‐value ingredients is becoming of great interest as a strategy for producing high‐quality sustainable food products. Therefore, pumpkin products such as pulp (PPU), peel (PPE), and seed (PS) were blended into wheat pasta at different proportions and combinations using D‐optimal mixture
Amira Oufighou, Fatiha Brahmi, Sabiha Achat, Leila Smail‐Benazzouz, Younes Arroul, Sarah Slimani, Sidahmed Saadi, Lila Boulekbache‐Makhlouf, Francisco Artés‐Hernández, Noelia Castillejo   +9 more
wiley   +1 more source

Tutte's first colour-cycle conjecture

, 1975
Includes bibliographical references.This thesis presents a proof of Conjecture I (see Section 35) of W. T. Tutte's paper "A contribution to the theory of chromatic polynomials''.
Kilpatrick, Peter Allan
core  

Approximations for chromatic polynomials

, 1976
A sequence of finite graphs may be constructed from a given graph by a process of repeated amalgamation. Associated with such a sequence is a transfer matrix whose minimum polynomial gives a recursion for the chromatic polynomials of the graphs in the ...
Biggs, N.L, Meredith, G.H.J
core   +1 more source

Proof of a Chromatic Polynomial Conjecture

Journal of Combinatorial Theory, Series B, 2000
Let \(P(G,\lambda)\) be the chromatic polynomial of a graph \(G\) (i.e., the number of mappings \(f\) from the vertex set of \(G\) to \(\{1,2,\dots, \lambda\}\) such that \(f(x)\neq f(y)\) whenever \(x\) and \(y\) are adjacent vertices in \(G\) if \(\lambda\) is a positive integer).
openaire   +1 more source

Spectral characterization of optical aberrations in fluidic lenses

Frontiers in Physics
We report an extensive numerical study and supporting experimental results on the spectral characterization of optical aberrations in macroscopic fluidic lenses with tunable focal distance and aperture shape.
Graciana Puentes, Graciana Puentes, Fernando Minotti, Fernando Minotti   +3 more
doaj   +1 more source

Chromatic Polynomials and Orbital Chromatic Polynomials and their Roots

, 2015
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is the number of proper k colorings of the graph. We can then find the orbital chromatic polynomial of a graph and a group of automorphisms of the graph ...
Ortiz, Jazmin
core  

Chromatic Polynomials of Some Mixed Hypergraphs [PDF]

, 2014
Motivated by a recent result of M. Walter [Electron. J. Comb. 16, No. 1, Research Paper R94, 16 p. (2009; Zbl 1186.05059)] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed ...
Allagan , Julian A. D., NC DOCKS at Elizabeth City State University   +1 more
core  

Chromatic polynomials and broken cycles

, 1975
We study the “broken circuits” introduced by H. Whitney, and their applications to chromatic polynomials, using as a main tool the idea of the cycle ...
Hoggar, S.G
core   +1 more source

Euler characteristics and chromatic polynomials

European Journal of Combinatorics, 2007
This work studies the relation between the chromatic polynomial of a graph \(G\) and the Euler characteristic of certain spaces. These spaces are obtained by a construction which is a generalization of the configuration space. The authors show, in the case that \(G\) has only one point, the following theorem: Let \(G\) be a graph and \(M_G\) the ...
Michael Eastwood, Stephen Huggett
openaire   +2 more sources

Chromatic polynomials and logarithmic concavity

, 1974
The conjecture that all chromatic polynomials have strong logarithmic concavity would, if true, establish R. C. Read's conjecture on their coefficients.
Hoggar, S.G
core   +1 more source