Results 61 to 70 of about 96,099 (217)
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
Discussiones Mathematicae Graph Theory, 2017 An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours.
Alva-Samos Jesús +1 more
doaj +1 more source
Rainbow $k$-connectivity of random bipartite graphs [PDF]
, 2012 A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$ internally ...
Chen, Xiaolin +2 more
core
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
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
ESG Decoupling Phenomenon: A Systematic and Bibliometric Analysis
Business Strategy and the Environment, EarlyView.ABSTRACT ESG decoupling, defined as the gap between a firm's ESG disclosures and its actual practices, poses a critical challenge to corporate sustainability. Using the PRISMA protocol, 451 articles were selected for a comprehensive bibliometric and systematic literature review to map the intellectual structure and thematic evolution of the research on
Maryam Laeeq +2 more
wiley +1 more source
Rainbow connection in $3$-connected graphs [PDF]
, 2010 An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in ...
Li, Xueliang, Shi, Yongtang
core
Inclusive or Inauthentic? Consumer Scepticism Towards LGBTQ‐Themed Cause‐Related Marketing
Journal of Consumer Behaviour, EarlyView.ABSTRACT Cause‐related marketing (CRM) is widely used to signal corporate social responsibility and engage ethically motivated consumers, yet its effectiveness remains contested in identity‐sensitive domains such as LGBTQ inclusion. Drawing on Social Identity Theory and Attribution Theory, this research examines how LGBTQ cause identification ...
Wilson N. Ndasi
wiley +1 more source
Rainbow Connection of Random Regular Graphs [PDF]
, 2014 An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are needed in ...
Dudek, Andrzej +2 more
core +1 more source
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
(Strong) rainbow connection on the splitting of 3-path [PDF]
AIP Conference Proceedings, 2017 The rainbow connection number of a graph G, denoted rc(G), is the smallest number of colors needed to color the edges of G so that any two vertices are connected by a path whose edges all have different colors. Similarly we define the strong rainbow connection number of G, denoted by src(G), by replacing “path” with “geodesic”.
F. Septyanto, K. A. Sugeng
openaire +1 more source