Results 61 to 70 of about 1,445 (260)
Gallai-Ramsey Numbers for Rainbow S3+S_3^ + and Monochromatic Paths
Discussiones Mathematicae Graph Theory, 2022 Motivated by Ramsey theory and other rainbow-coloring-related problems, we consider edge-colorings of complete graphs without rainbow copy of some fixed subgraphs.
Li Xihe, Wang Ligong
doaj +1 more source
Developmental Dynamics, EarlyView.Abstract Background Sporadic venous malformation (VM) is associated with the hyperactivating p.L914F mutation in TIE2, a receptor tyrosine kinase essential for vascular development. This mutation is not found in hereditary VM, suggesting incompatibility with life when expressed during early vascular development.
Lindsay J. Bischoff +6 more
wiley +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Graphs with 4-Rainbow Index 3 and n − 1
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 called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang +3 more
doaj +1 more source
Rainbow Connection Number on Amalgamation of General Prism Graph
InPrime, 2019 Let be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors).
Rizki Hafri Yandera +2 more
doaj +1 more source
A Note on Extendable Sets of Colorings and Rooted Minors
Journal of Graph Theory, EarlyView.ABSTRACT DeVos and Seymour proved that for every set C $C$ of 3‐colorings of a set X $X$ of vertices, there exists a plane graph G $G$ with vertices of X $X$ incident with the outer face such that a 3‐coloring of X $X$ extends to a 3‐coloring of G $G$ if and only if it belongs to C $C$.
Zdeněk Dvořák, Jan M. Swart
wiley +1 more source
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
Rainbow-free 3-colorings in abelian groups [PDF]
Electronic Notes in Discrete Mathematics, 2009 A $3$-coloring of the elements of an abelian group is said to be rainbow-free if there is no $3$-term arithmetic progression with its members having pairwise distinct colors. We give a structural characterization of rainbow-free colorings of abelian groups. This characterization proves a conjecture of Jungić et al. on the size of the smallest chromatic
Amanda Montejano, Oriol Serra
openaire +5 more sources
Microbial communities and functional diversity in seafood
JSFA reports, EarlyView.Abstract Functional diversity encompasses ecosystem processes that enhance adaptability to environmental change. This study explores the diversity of microorganisms associated with seafood. In this paper, we present our knowledge of microbial diversity in relation to seafood.
Christian Larbi Ayisi +3 more
wiley +1 more source