Results 41 to 50 of about 156 (148)

Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles

Theory and Applications of Graphs, 2017
For positive integers m, n, the greatest number of colors that can appear in an edge coloring of K(m,n) which avoids rainbow cycles is m + n - 1. Here these colorings are constructively characterized.
Peter Johnson, Claire Zhang
doaj   +1 more source

Rapid Discovery of TiO2/ZnFe2O4/Cu Ternary Photocatalysts for Volatile Organic Compounds Degradation via High‐Throughput Screening Photogenerated Carriers Transfer Properties

Materials Genome Engineering Advances, EarlyView.
This study develops a high‐throughput screening method using carrier mobility as a key descriptor. Taking the TiO2/ZnFe2O4/Cu ternary photocatalytic system as an example, we rapidly identify high‐performance components for VOCs degradation, confirm that the performance trends of thin‐film catalysts match those of their powder counterparts with the same
Tao Liang, Yuxue Wei, Fang Chen, Zhe Yuan, Xinyu Wang, Faze Wang, Xizuo Dan, Song Sun   +7 more
wiley   +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

Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning

Journal of Field Robotics, EarlyView.
ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi, Alberto Topini, Alessandro Bucci, Alessandro Ridolfi   +3 more
wiley   +1 more source

Rainbow Vertex Coloring for Line, Middle, Central, Total Graph of Comb Graph

Indian Journal of Science and Technology, 2016
Objectives: To find the rainbow vertex connection number for Line, Central, Middle and Total graphs of Comb Graph. Methods/Statistical Analysis: The methods to find the rainbow vertex connection number of any graph G is quite different from other coloring problems.
C. S. Hariramkumar, N. Parvathi
openaire   +1 more source

Exploring Interactive Effects of Arsenic and Selenium Exposure on Larval Zebrafish (Danio rerio)

Environmental Toxicology, EarlyView.
ABSTRACT Arsenic contamination in aquatic ecosystems is a major environmental concern. Selenium (Se) helps mitigate oxidative stress and hence could reduce the toxic effects of arsenic. However, Se can also be toxic at high concentrations. Given that these metalloids commonly co‐occur in the environment, there is a pressing need for further research ...
Owen Luo, Jinnath Rehana Ritu, Md Helal Uddin, Sravan Kumar Putnala, Mahesh Rachamalla, Som Niyogi, Douglas P. Chivers   +6 more
wiley   +1 more source

Graphs with 3-Rainbow Index n − 1 and n − 2

Discussiones Mathematicae Graph Theory, 2015
Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

Isolated in the highlands, found in the museum: A new species of Characidium (Crenuchidae) from a Bolivian National Park, with a CT scan revealing features

Journal of Fish Biology, EarlyView.
Abstract A new species of Characidium is described from a small, isolated river in the highland areas of Noel Kempff Mercado National Park, Bolivia. The new taxon can be diagnosed by the presence of a relatively broad and conspicuous dark midlateral stripe extending from the tip of snout to the base of the caudal fin, markedly darker than the vertical ...
Leonardo Oliveira‐Silva, Karina Or, Angela Zanata, Scott A. Schaefer   +3 more
wiley   +1 more source

The 3-Rainbow Index of a Graph

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 a rainbow tree if no two edges of T receive the same color.
Chen Lily, Li Xueliang, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth

Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.
ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley   +1 more source