Results 91 to 100 of about 96,099 (217)
The hitting time of rainbow connection number two
In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one rainbow path is ...
Heckel, Annika, Riordan, Oliver
core
Fish welfare in a changing world: New developments and current challenges
Abstract The welfare of non‐human animals is central to ethical discussions on animal use, with increasing attention to fish welfare across research, aquaria, aquaculture, and fisheries. This paper reviews current theoretical approaches to animal welfare and recent advances in defining and assessing fish welfare since the seminal paper by Huntingford ...
Sonia Rey Planellas +16 more
wiley +1 more source
Bounds on coloring trees without rainbow paths
For a graph with colored vertices, a rainbow subgraph is one where all vertices have different colors. For graph $G$, let $c_k(G)$ denote the maximum number of different colors in a coloring without a rainbow path on $k$ vertices, and $cp_k(G)$ the maximum number of colors if the coloring is required to be proper.
Wayne Goddard +2 more
openaire +2 more sources
Rainbow Connection In Sparse Graphs
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours
Kemnitz Arnfried +3 more
doaj +1 more source
Abstract Methods using environmental nucleic acids have become highly effective for monitoring aquatic biodiversity, with an array of suitable use cases, including metrics for fisheries assessment. Traditional methods for assessing fish populations often rely on invasive techniques with limited spatial and temporal coverage.
Ana Ramón‐Laca +6 more
wiley +1 more source
An edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices.
Mohammed A. Mutar +2 more
doaj +1 more source
Abstract Introduction There is urgency for health professionals to be better prepared to tackle health inequities. Transitioning to responsive and contextually relevant curricula is an important strategy to equip students to be both clinically competent and critically conscious of the contexts in which they provide health care.
Anthea Hansen +2 more
wiley +1 more source
ABSTRACT A growing body of scholarship argues that collective memories of historical environmental change—formed and transmitted through museums, movies, novels, activist performances and other cultural texts and practices—can help nurture proenvironmentalism.
Olli Hellmann
wiley +1 more source
Middlebrow Aesthetics: An Explanation and Defense
ABSTRACT We offer a philosophical account of the middlebrow as a theoretical category to do explanatory and critical work in aesthetics. On our account, the middlebrow ought to be understood as aspirational popular art. That is, it is art which aspires both to be popular (in a distinctive sense), and at the same time to be something more than popular ...
Aaron Meskin, Jonathan M. Weinberg
wiley +1 more source
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths
We prove that for all integers $\kappa, s\ge 0$ there exists $c$ with the following property. Let $G$ be a graph with clique number at most $\kappa$ and chromatic number more than $c$. Then for every vertex-colouring (not necessarily optimal) of $G$, some induced subgraph of $G$ is an $s$-vertex path, and all its vertices have different colours.
Alex Scott 0001, Paul D. Seymour
openaire +4 more sources

