INHAND: Non-proliferative and proliferative lesions of fish - Chapter 3. Fish digestive system. [PDF]
Baumgartner W +13 more
europepmc +1 more source
High-resolution reconstruction of a Jumbo-bacteriophage infecting capsulated bacteria using hyperbranched tail fibers. [PDF]
Ouyang R +11 more
europepmc +1 more source
Fuzzy incidence coloring under structural operations for communication channel allocation. [PDF]
Deji A, Wang Q, Zhou L.
europepmc +1 more source
ANALISIS RAINBOW DAN STRONG RAINBOW VERTEX CONNECTION PADA GRAF HASIL OPERASI COMB SISI
nilai Rainbow Vertex Connection dan Strong Rainbow Vertex Connection pada graf hasil operasi comb sisi (a) rvc(PnDBtm) = srvc(PnDBtm) = n−2 sisi x1x2 sebagai sisi cangkok pada graf Btm (b) rvc(PnDBtm) = srvc(PnDBtm) = n−1 sisi xiuj sebagai sisi ...
Muharromah, Agustina
core
GGAssembler: Precise and economical design and synthesis of combinatorial mutation libraries. [PDF]
Hoch SY +5 more
europepmc +1 more source
Communicating clinical trial information about cancer drug products to patients and healthcare professionals: review of patient-reported outcome messaging. [PDF]
Shahraz S +8 more
europepmc +1 more source
Mobility-Aware Resource Allocation in IoRT Network for Post-Disaster Communications with Parameterized Reinforcement Learning. [PDF]
Kabir H +4 more
europepmc +1 more source
Homogeneous isosceles-free spaces. [PDF]
Bargetz C +3 more
europepmc +1 more source
Cryo-EM structure of enteric adenovirus HAdV-F41 highlights structural variations among human adenoviruses. [PDF]
Pérez-Illana M +7 more
europepmc +1 more source
The Rainbow Connection Number of The Commuting Graph of a Finite Nonabelian Group
A path in an edge-colored graph is called a rainbow path if every two distinct edges of the path have different colors. A graph whose every pair of vertices are linked by a rainbow path is called a rainbow-connected graph.
Putri, Pritta Etriana +2 more
core

