Results 221 to 230 of about 53,855 (264)

Virulence evolution of a salmonid virus following a host jump. [PDF]

open access: yesPLoS Pathog
Loeher MM   +6 more
europepmc   +1 more source

A genome assembly for Lahontan Cutthroat Trout, Oncorhynchus clarkii henshawi. [PDF]

open access: yesJ Hered
Payne CY   +7 more
europepmc   +1 more source

Rainbow cycles versus rainbow paths [PDF]

open access: possibleAustralas. 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

Home - About - Disclaimer - Privacy