Results 211 to 220 of about 1,117,749 (247)

How to get the most out of fungal biotechnology? [PDF]

Fungal Biol Biotechnol
Nygård Y, Meyer V.
europepmc   +1 more source

The potential role of presenteeism in the association between resilience and intention to continue as a nurse among new graduate and mid-career nurses: A mediation analysis. [PDF]

Int J Nurs Stud Adv
Yamaguchi K, Kitagawa A, Yashiro R, Kato K, Matsumoto C, Chiang C.   +5 more
europepmc   +1 more source

Rainbow connections of bioriented graphs. [PDF]

Heliyon
Wang L, Liu S, Jiang H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Complete graphs and complete bipartite graphs without rainbow path

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ligong Wang
exaly   +2 more sources

On the Complexity of Locally Rainbow Path

Lecture Notes in Computer Science
Tesshu Hanaka, Eiji Miyano, Hiroshi Eto   +2 more
exaly   +2 more sources

Rainbow numbers for paths in planar graphs

Applied Mathematics and Computation, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongmei Qin, Shasha Li, Yongxin Lan, Jun Yue   +3 more
openaire   +1 more source

Rainbow Domination in Cartesian Product of Paths and Cycles

International Journal of Foundations of Computer Science, 2023
Let [Formula: see text] be a graph and [Formula: see text] be an integer representing [Formula: see text] colors. There is a function [Formula: see text] from [Formula: see text] to the power set of [Formula: see text] colors satisfying every vertex [Formula: see text] assigned [Formula: see text] under [Formula: see text] in its neighborhood has all ...
Hong Gao 0002, Yunlei Zhang, Yuqi Wang, Yuanyuan Guo, Xing Liu, Renbang Liu, Changqing Xi, Yuansheng Yang   +7 more
openaire   +3 more sources

Rainbow cycles versus rainbow paths

Australas. J Comb., 2021
An edge-colored graph \(F\) is rainbow if every edge of \(F\) has a unique color. The rainbow Turán number \(\text{ex}^{\ast}(n,F)\) of a graph \(F\) is the maximum number of edges in a properly edge-colored \(n\)-vertex graph with no rainbow copy of \(F\). This variant of the classic Turán number was first considered by \textit{P.
Anastasia Halfpap, Cory Palmer
openaire   +2 more sources

Complete graphs with no rainbow path

Journal of Graph Theory, 2006
AbstractMotivated by questions in Ramsey theory, we consider colorings of the edges of the complete graph Kn that contain no rainbow path Pt+1 of length t. If fewer than t colors are used then certainly there is no rainbow Pt+1. We show that, if at least t colors are used, then very few colorings are possible if t ≤ 5 and these can be described ...
Andrew Thomason 0001, Peter Wagner 0002
openaire   +2 more sources