Results 71 to 80 of about 303 (159)

Topology-based sparsification of graph annotations. [PDF]

Bioinformatics, 2021
Danciu D, Karasikov M, Mustafa H, Kahles A, Rätsch G.   +4 more
europepmc   +1 more source

On the total rainbow connection of the wheel related graphs

, 2018
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors.
Alfarisi, Ridho, M.S Hasan, Slamin, Slamin, Agustin, Ika Hesti, Dafik, Dafik   +4 more
core  

On the Complexity of Rainbow Coloring Problems

, 2018
An edge-colored graph G is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by rc(G), is the minimum number of colors needed to make G rainbow ...
Lauri, Juho, Eiben, Eduard; orcid:, Ganian, Robert; orcid:   +2 more
core   +1 more source

Computing minimum rainbow and strong rainbow colorings of block graphs

, 2018
A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbow-connected if there is a rainbow path between every pair of vertices.
Lauri, Juho, Keranen, Melissa, Karanen, Melissa, Melissa Keranen, Juho Lauri   +4 more
core   +1 more source

Structure of the siphophage neck-Tail complex suggests that conserved tail tip proteins facilitate receptor binding and tail assembly. [PDF]

PLoS Biol, 2023
Xiao H, Tan L, Tan Z, Zhang Y, Chen W, Li X, Song J, Cheng L, Liu H.   +8 more
europepmc   +1 more source

Gallai-Ramsey and vertex proper connection numbers

, 2015
Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number N such that every coloring of G using exactly k colors contains either a rainbow triangle or a monochromatic star on t vertices.
Emily C. Chizmar, Chizmar, Emily C
core  

An updated survey on rainbow connections of graphs - a dynamic survey

, 2017
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Li, Xueliang, Xueliang Li, Sun, Yuefang, Yuefang Sun   +3 more
core   +1 more source

Structures of pseudorabies virus capsids. [PDF]

Nat Commun, 2022
Wang G, Zha Z, Huang P, Sun H, Huang Y, He M, Chen T, Lin L, Chen Z, Kong Z, Que Y, Li T, Gu Y, Yu H, Zhang J, Zheng Q, Chen Y, Li S, Xia N.   +18 more
europepmc   +1 more source

Rainbow Connection Number of Special Graph and Its Operations

, 2014
Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to ...
Nastiti, Artanty, Dafik, Dafik
core  

CONTINUITY: CONnectivity Tool with INtegration of sUbcortical regions, regIstration and visualization of TractographY. [PDF]

Proc SPIE Int Soc Opt Eng, 2022
Piot E, Bagonis M, Prieto JC, Styner M.
europepmc   +1 more source