Results 81 to 90 of about 1,117,749 (247)
Computer Graphics Forum, EarlyView.Abstract Recent advances in AI enable the automatic generation of visualizations directly from textual prompts using agentic workflows. However, visualizations produced via one‐shot generative methods often suffer from insufficient quality, typically requiring a human in the loop to refine the outputs.
Roxana Bujack +4 more
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
Bounds on coloring trees without rainbow paths
Discussiones Mathematicae Graph TheoryFor 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
PEG400 regulates Falcipain 2 activity through an allosteric mechanism
The FEBS Journal, EarlyView.Falcipain‐2 can potentially be leveraged as a drug target due to its critical role as a haemoglobinase during the intra‐erythrocytic stage of Plasmodium falciparum. Here, we investigate the regulation of the proteolytic and haemoglobinase activity of falcipain‐2 in the presence of polyethylene glycol.
Bikram Nath +2 more
wiley +1 more source
Rainbow Connection In Sparse Graphs
Discussiones Mathematicae Graph Theory, 2013 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
Constrictions and shear stress are key determinants of amyloidogenic light chain (AL) amyloidosis
The FEBS Journal, EarlyView.In this study, we investigate how flow constrictions and shear stress trigger cardiac antibody light chain (AL) fibril formation and deposition. We mimic the mechanical forces exerted by the heart and the microvasculature network using a mini‐peristaltic pump setup and a grid‐type microchannel network, respectively.
Yuji Goto +11 more
wiley +1 more source
MathematicsAn 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
Rainbow Gazette, Volume 5, Issue 1, January 2000
, 2000 The Rainbow Garden Club is an LGBT organization devoted to broadening member's knowledge about plants, gardening and landscape design.
Rainbow Garden Club (San Antonio, Tex.)
core
Journal of Advanced Nursing, EarlyView.ABSTRACT Aim To develop and psychometrically validate the Reasons Employees Perceive Obstacles to Reporting (REPORT) Scale, a self‐report instrument designed to identify barriers to incident reporting. Design Guided by the Theory of Planned Behaviour, this study used a descriptive, multiphase psychometric design.
Scott S. Christensen +5 more
wiley +1 more source