Results 171 to 180 of about 15,555,412 (284)

Construction of a personality trait prediction model based on color perception preference and personalized cognitive intervention pathways in art education. [PDF]

Front Psychol
Yang S, Sun Z, Jin A, Zhao X, Xie Y, Li M.   +5 more
europepmc   +1 more source

AVD-total-chromatic number of some families of graphs with Δ(G)=3

Discrete Applied Mathematics, 2017
A. Luiz, C. N. Campos, C. D. de Mello
semanticscholar   +1 more source

Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3

Journal of Graph Theory, EarlyView.
ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley   +1 more source

An empirical three-dimensional metric field for color space. [PDF]

J Vis
Koenderink JJ, van Doorn AJ, Braun DI, Gegenfurtner KR.   +3 more
europepmc   +1 more source

Path Degeneracy and Applications

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we relate girth and path‐degeneracy in classes with sub‐exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor‐closed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$‐cages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley   +1 more source

Effects of color-enhancing filters on color salience in normal trichromats. [PDF]

Vision Res
Simoncelli C, McPherson D, Knoblauch K, Webster M.   +3 more
europepmc   +1 more source

On Sparsity Conditions Guaranteeing a Fractional Coloring

Journal of Graph Theory, EarlyView.
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley   +1 more source

A Note on Lovász Characterization of Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley   +1 more source

Elucidating the photo-induced fading mechanism in green tea beverages: Metabolomics-guided discovery, quantification, and spiking validation of critical metabolites. [PDF]

Food Chem X
Wang S, Li S, Tu Z, Tao M, Yu Q, Xu A, Cao Y, Liu Z.   +7 more
europepmc   +1 more source

Two‐Block Paths in Oriented Graphs of Large Semidegree

Journal of Graph Theory, EarlyView.
ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers k $k$ and ℓ $\ell $ with k / 2 ≤ ℓ < k $k/2\le \ell \lt k$, we establish a semidegree function that guarantees the containment of every oriented path with ...
Irena Penev, S Taruni, Stéphan Thomassé, Ana Trujillo‐Negrete, Mykhaylo Tyomkyn   +4 more
wiley   +1 more source