Results 181 to 190 of about 96,099 (217)

Restless reachability problems in temporal graphs. [PDF]

Knowl Inf Syst
Thejaswi S, Lauri J, Gionis A.
europepmc   +1 more source

Hormonal Masculinization of the European Grayling (<i>Thymallus thymallus</i>) Using 11β-Hydroxyandrostenedione (OHA) and 17α-Methyltestosterone (MT). [PDF]

Animals (Basel)
Rożyński R, Kuciński M, Dobosz S, Kycko A, Ocalewicz K.   +4 more
europepmc   +1 more source

Plant simulation for robot automation system of deep-frying process of <i>Kimbugak</i>. [PDF]

Food Sci Biotechnol
Kim TH, Byoung G, Kwon KH, Kim AN.
europepmc   +1 more source

Rainbow cycles versus rainbow paths [PDF]

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   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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   +2 more sources

On the Complexity of Locally Rainbow Path

Lecture Notes in Computer Science
Hiroshi Eto, Tesshu Hanaka
exaly   +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   +1 more source

From Colourful to Rainbow Paths in Graphs: Colouring the Vertices

Graphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer   +2 more
openaire   +2 more sources

Zero-path-difference rainbow holography

Optics Letters, 1985
Rainbow holography without the use of a slit has been demonstrated by combining Abramson's light-in-flight approach [Opt. Lett. 3, 121 (1978)] with Benton's rainbow technique [J. Opt. Soc. Am. 59, 1545 (A) 1969]. The system natural slit-shaped pupil whose extent and position are determined by the experimental parameters.
F, Quercioli, G, Molesini, S F, Jacobs
openaire   +2 more sources