A solution to a conjecture on the rainbow connection number [PDF]
, 2010 Xiaolin Chen, Xueliang Li
openalex +1 more source
Fisheries Management and Ecology, EarlyView.ABSTRACT The American Lobster (Homarus americanus) is the target of an extensive fishery in the Northwest Atlantic, yet there is no systematic method for evaluating relative performance of baits for the fishery. We used Baited Remote Underwater Video (BRUV) to assess lobster attraction to commercial baits versus natural prey.
L. Grace Walls +5 more
wiley +1 more source
Fisheries Management and Ecology, EarlyView.ABSTRACT Stocking fish is a common practice in fisheries management, particularly for species of high conservation value or economic importance. Despite its widespread use, systematic evaluation of fish stockings remains scarce. This includes non‐native species such as rainbow trout (Oncorhynchus mykiss), which are intensively stocked into European ...
Christoffer Nagel +4 more
wiley +1 more source
Energetics of the Citric Acid Cycle in the Deep Biosphere
Geophysical Monograph Series, Page 303-327., 2020 This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Peter A. Canovas III, Everett L. Shock
wiley +1 more source
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BarekengLet be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
List rainbow connection number of graphs
An edge-coloured path is rainbow if all of its edges have distinct colours. Let $G$ be a connected graph. The rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow path. The strong rainbow connection number of $G$, denoted by $src(G)$, is
Tang, Rongxia +3 more
openaire +2 more sources
Stitching Serenity: Exploring Theories of Well‐Being Through Embroidery
International Journal of Art &Design Education, EarlyView.Abstract This study investigates how embroidery as a tactile form of inquiry can enhance students' understanding of well‐being concepts. Drawing on Bereiter's (2002, Education and Mind in the Knowledge Age) idea of naturalising abstract knowledge objects, we examine how students materialised their theoretical mind maps through embroidery.
Henna Lahti, Päivi Fernström
wiley +1 more source
Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph [PDF]
, 2011 Lily Chen, Xueliang Li, Mengmeng Liu
openalex +1 more source
Understanding Nurses' Needs Regarding Tailored, Evidence‐Based Sleep Education and Training
Journal of Advanced Nursing, EarlyView.ABSTRACT Aim Identify desired training content for shift‐working nurses to improve their sleep and fatigue. Design A descriptive qualitative design. Methods We recruited night shift nurses (N = 23) to provide feedback during virtual focus groups/interviews. Data collection occurred in the U.S. between March and June 2024.
Beverly M. Hittle +7 more
wiley +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source