Results 51 to 60 of about 156 (148)

Inside a duck‐billed dinosaur: Vertebral bone microstructure of Huallasaurus (Hadrosauridae), Upper Cretaceous of Patagonia

The Anatomical Record, Volume 309, Issue 7, Page 1702-1712, July 2026.
Abstract Dinosaurs evolved a unique respiratory system with air sacs that contributed to their evolutionary success. Postcranial skeletal pneumaticity (PSP) has been used to infer the presence of air sac systems in some fossil archosaurs. While unambiguous evidence of PSP is well documented in pterosaurs and post‐Carnian saurischians, it remains absent
Tito Aureliano, Aline M. Ghilardi, Jonatan Kaluza, Agustín G. Martinelli   +3 more
wiley   +1 more source

Graphs with 4-Rainbow Index 3 and n − 1

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 called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan   +3 more
doaj   +1 more source

The Rainbow Vertex-Connection Number of Star Fan Graphs

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018
A vertex-colored graph  is said to be rainbow vertex-connected, if for every two vertices  and  in , there exists a  path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan, A.N.M. Salman   +1 more
doaj   +1 more source

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

, 2018
Given a graph with colors on its vertices, a path is called a rainbow vertex path if all its internal vertices have distinct colors. We say that the graph is rainbow vertex-connected if there isa rainbow vertex path between every pair of its vertices. We study the problem of deciding whether the vertices of a given graph can be colored with at most k ...
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen   +4 more
openaire   +6 more sources

The impacts of biological invasions

Biological Reviews, Volume 101, Issue 3, Page 1255-1310, June 2026.
ABSTRACT The Anthropocene is characterised by a continuous human‐mediated reshuffling of the distributions of species globally. Both intentional and unintentional introductions have resulted in numerous species being translocated beyond their native ranges, often leading to their establishment and subsequent spread – a process referred to as biological
Phillip J. Haubrock, Teun Everts, Neil Angelo S. Abreo, Jamie Bojko, Victor Deklerck, James W. E. Dickey, Ana Clara S. Franco, Emili García‐Berthou, Stelios Katsanevakis, Natalia I. Kirichenko, Stefano Mammola, Martin A. Nuñez, Ben Parker, Riccardo Scalera, Ismael Soto, Diederik Strubbe, Ali Serhan Tarkan, Lorenzo Vilizzi, Tim Adriaens, Paride Balzani, Dagmara Błońska, Elizabeta Briski, Rein Brys, Amy L. Burgess, James E. Byers, Carlos Cano‐Barbacil, Giuseppe Castaldelli, Jaimie T.A. Dick, Victoria Dominguez Almela, Romina D. Dimarco, Margarita Florencio, Antonín Kouba, Melina Kourantidou, Irmak Kurtul, Irene Martín‐Forés, Olivier Morissette, Julian D. Olden, Bruno E. Soares, Jakub Truszkowski, Hugo Verreycken, Marc Kenis, Ronaldo Sousa, J. Robert Britton   +42 more
wiley   +1 more source

The Vertex-Rainbow Index of A Graph

Discussiones Mathematicae Graph Theory, 2016
The k-rainbow index rxk(G) of a connected graph G was introduced by Chartrand, Okamoto and Zhang in 2010. As a natural counterpart of the k-rainbow index, we introduce the concept of k-vertex-rainbow index rvxk(G) in this paper.
Mao Yaping
doaj   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.
ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

Generalized Rainbow Connection of Graphs and their Complements

Discussiones Mathematicae Graph Theory, 2018
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang, Magnant Colton, Wei Meiqin, Zhu Xiaoyu   +3 more
doaj   +1 more source

Advances in BiOCl‐Based Photocatalysts: From Synthesis, Structural Tailoring to Solar Energy Conversion

Rare Metals, Volume 45, Issue 6, June 2026.
ABSTRACT Semiconductor photocatalysis represents a pivotal frontier in the quest for sustainable energy and environmental remediation. Among the diverse catalytic materials, Bismuth Oxychloride (BiOCl) has emerged as a particularly promising candidate due to its unique layered structure, featuring [Bi2O2]2+ layers intertwined with halogen ions, which ...
Liu Han, Bin Wu, Jie Wang, Yang Su, Yingtang Zhou, Zhongyi Jiang   +5 more
wiley   +1 more source

Coloring subgraphs with restricted amounts of hues

Open Mathematics, 2017
We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a ...
Goddard Wayne, Melville Robert
doaj   +1 more source