Results 61 to 70 of about 13,653 (313)
Gallai-Ramsey Numbers for Rainbow S3+S_3^ + and Monochromatic Paths
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
We conducted a longitudinal trial across nursery, growing, and finishing phases, showing that phytochemical supplementation as a potential antibiotic alternative reduced potential pathogens and promoted beneficial Lactobacillus amylovorus in the nursery phase, and enriched amino acid and carbohydrate metabolism pathways (prediction) during finishing ...
Ziyu Liu +11 more
wiley +1 more source
Graphs with 3-Rainbow Index n − 1 and n − 2
Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, 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.
Li Xueliang +3 more
doaj +1 more source
Proper Edge Colorings of Cartesian Products with Rainbow $$C_4$$-s [PDF]
András Gyárfás, Gábor N. Sárközy
openalex +1 more source
The Development of RBL-STEM Learning Materials to Improve Students' Computational Thinking Skills in Solving Rainbow Vertex Antimagic Coloring Problems and It's Application for Batik Motif Design [PDF]
Dahlan Irawan, Dafik Dafik, I Made Tirta
openalex +3 more sources
Listening to Hong Kong children's perspectives through pretend play
Abstract Quality in early childhood education and care (ECEC) has become an increasing concern in recent years. The issue has been regularly discussed by different stakeholders. However, the rising concern regarding quality in ECEC has not seriously taken into account children's perspectives.
Suzannie K. Y. Leung
wiley +1 more source
WORM Colorings of Planar Graphs
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
Symmetric Layer-Rainbow Colorations of Cubes
9 pages, 1 ...
openaire +2 more sources
The impacts of biological invasions
ABSTRACT The Anthropocene is characterised by a continuous human‐mediated reshuffling of the distributions of species globally. Both intentional and unintentional introductions have resulted in numerous species being translocated beyond their native ranges, often leading to their establishment and subsequent spread – a process referred to as biological
Phillip J. Haubrock +42 more
wiley +1 more source
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source

