Results 271 to 280 of about 115,985 (312)

The effect of mandala coloring on anxiety and quality of life of women in the climacteric period: a randomized controlled study. [PDF]

Rev Assoc Med Bras (1992)
Kırca AŞ, Dağlı E, Derin E, Aka N.
europepmc   +1 more source

Extemporaneous Formulations for Pediatric Patients: Global Necessities, Challenges and Opportunities. [PDF]

Pharmaceutics
Pai VB, Nahata MC.
europepmc   +1 more source

Isobaric Labeling Update in MaxQuant. [PDF]

J Proteome Res
Ferretti D, Kyriakidou P, Xiao J, Urazbakhtin S, De Nart C, Cox J.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Sum List Coloring Graphs

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berliner, Adam, Bostelmann, Ulrike, Brualdi, Richard A., Deaett, Louis   +3 more
openaire   +2 more sources

List-coloring – Parameterizing from triviality

Theoretical Computer Science, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arora, Pranav, Banik, Aritra, Paliwal, Vijay Kumar, Raman, Venkatesh   +3 more
openaire   +1 more source

A note on list‐colorings

Journal of Graph Theory, 1989
AbstractIn this article we discuss the current results on the list chromatic conjecture and prove that if G is a triangle free graph with maximum degree Δ then χapos;|(G) ⩽; 9Δ/5.
Chetwynd, Amanda G., Haggkvist, Roland A.   +1 more
openaire   +2 more sources

Sum List Colorings of Wheels

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kemnitz, Arnfried, Marangio, Massimiliano, Voigt, Margit   +2 more
openaire   +1 more source

Colorings versus list colorings of uniform hypergraphs

Journal of Graph Theory, 2020
AbstractLet be an integer with and be a connected ‐uniform hypergraph with edges. By refining the broken cycle theorem for hypergraphs, we show that if , then the ‐list assignment of admitting the fewest colorings is the constant list assignment. This extends the previous results of Donner, Thomassen, and the current authors for graphs.
Wei Wang, Jianguo Qian, Zhidan Yan
openaire   +1 more source

On list‐coloring outerplanar graphs

Journal of Graph Theory, 2008
AbstractWe prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists).
openaire   +2 more sources