Results 81 to 90 of about 13,653 (313)
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han +3 more
wiley +1 more source
The strong rainbow vertex-connection of graphs [PDF]
, 2012 A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected
Li, Xueliang, Mao, Yaping, Shi, Yongtang
core
Journal of Organizational Behavior, EarlyView.ABSTRACT As organizations increasingly adopt human‐AI teams (HATs), understanding how to enhance team performance is paramount. A crucially underexplored area for supporting HATs is training, particularly helping human teammates to work with these inorganic counterparts.
Caitlin M. Lancaster +5 more
wiley +1 more source
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Integer colorings with forbidden rainbow sums
, 2020 For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which ...
Cheng, Yangyang +4 more
core
On small Mixed Pattern Ramsey numbers [PDF]
, 2014 We call the minimum order of any complete graph so that for any coloring of the edges by $k$ colors it is impossible to avoid a monochromatic or rainbow triangle, a Mixed Ramsey number.
Bartlett, Marcus +4 more
core
International Journal of Research -GRANTHAALAYAH, 2014 Our nature is adorned with many colors. All the colors of the rainbow are spread in nature. Each color has its own different effect. With our favorite color, we can get complete information about the mentality of an individual world.The color of light - Why do we get different colors in the rainbow? This fact was discovered in 1665 by Newton.
openaire +2 more sources
Rainbow Matchings in Properly Colored Multigraphs [PDF]
SIAM Journal on Discrete Mathematics, 2018 Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n$ colours with at least $n + 1$ edges of each colour there must be a matching that uses each colour exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities $o(
Keevash, P, Yepremyan, L
openaire +5 more sources
(Re)humanizing Blackness: Integrating BlackCrit in the Mental Health Counseling of Black Clients
The Journal of Humanistic Counseling, EarlyView.ABSTRACT Does Black mental health matter? Historically, mental illness in the Black community has been inadequately addressed. Yet Black Americans experience more severe psychological distress than other races, and they are also more likely to experience poor outcomes in counseling.
Demetrius Cofield
wiley +1 more source
Labyrinthine Abnormalities on MRI in Untreated Otosclerosis: Prevalence and Clinical Relevance
The Laryngoscope, EarlyView.In untreated otosclerosis with labyrinthine symptoms, delayed 3D FLAIR MRI rarely demonstrates endolymphatic hydrops but frequently reveals blood–labyrinth barrier (BLB) disruption. BLB enhancement is spatially associated with cochlear endosteal and round window involvement and increases with the severity of the hearing loss phenotype.
Héléna Pencroffi +7 more
wiley +1 more source