Results 51 to 60 of about 112,754 (257)
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
Animal Research and One Health, EarlyView.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
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
Medical students' perspectives on body donation to science within the Italian context
Anatomical Sciences Education, EarlyView.Abstract Body donation is essential for medical education and research, supporting anatomical training and clinical competence. In Italy, national data on awareness of the legislation regulating body donation and factors shaping donation‐related decisions among healthcare trainees remain limited. This study investigated knowledge of the legal framework,
Antonietta Fazio +20 more
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
Anatomical Sciences Education, EarlyView.Abstract Providing students with a way to honor human body donors during or after an anatomy course has been shown to help provide a sense of closure and comfort to students and, when present, donor families. Gestures of gratitude for donors can also emphasize humanistic values of respect, empathy, and professionalism.
Bobbie J. Leeper +14 more
wiley +1 more source
On Rainbow Coloring of Quadrilateral Snake Graphs
A path is said rainbow if its edges have pairwise distinct colors. A graph G admits a rainbow coloring if there exists a rainbow path between every pair of vertices of G.
Aleffer Rocha +2 more
core +1 more source
Listening to Hong Kong children's perspectives through pretend play
British Educational Research Journal, EarlyView.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
The ecology of hope: Building rainbows in education systems
British Educational Research Journal, EarlyView.Abstract Hope is frequently invoked in education, yet rarely theorised. Where it has been theorised, it has been understood in two largely separate ways: as an individual psychological capacity, in the positive‐psychology tradition and as a critical‐emancipatory stance, in the pedagogy of hope.
Jennifer Achari
wiley +1 more source