Results 61 to 70 of about 21,615 (266)
Journal of Combinatorial Theory, Series A, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Clinical Anatomy, EarlyView.ABSTRACT International changes in the focus of medical school education have led to a decrease in the time allocated to anatomy education, with human specimen dissection particularly affected. This study evaluates whether a dissection‐based course facilitates the retention of three‐dimensional (3‐D) anatomical relationships in senior medical students ...
Thomas Stubley +4 more
wiley +1 more source
On the Restricted Size Ramsey Number Involving a Path P3
Discussiones Mathematicae Graph Theory, 2019 For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey number r*(G,H) are bounded above by the size of the complete graph with order equals to the Ramsey number r(G,H), and bounded below by e(G) + e(H) − 1 ...
Silaban Denny Riama +2 more
doaj +1 more source
Discrete Mathematics, 1980 AbstractWe consider the Ramsey number r(sK2, G) where sK2(s⩾1) denotes a set of s disjoint edges and G is an arbitrary finite simple graph with no isolated vertices. We obtain upper and lower bounds in the general case. Exact results are obtained for certain classes of graphs.
Ralph J. Faudree +2 more
openaire +1 more source
On weighted Ramsey numbers [PDF]
Australas. J Comb., 2007 15 ...
Maria Axenovich, Ryan R. Martin
openaire +2 more sources
Moderate Amylose Increases From SSIIa Mutations Modify Pasta Texture in Durum Wheat
Cereal Chemistry, EarlyView.ABSTRACT Background and Objectives Durum wheat (Triticum turgidum L. subsp. durum) pasta quality depends on grain yellowness, gluten strength, and protein content, and can be modified by altering starch composition. High‐amylose null mutants improve nutritional traits but often reduce seed size, yield, and processing quality.
Prashant Kumar +3 more
wiley +1 more source
Anti-Ramsey Number of Hanoi Graphs
Discussiones Mathematicae Graph Theory, 2019 Let ar(G,H) be the largest number of colors such that there exists an edge coloring of G with ar(G,H) colors such that each subgraph isomorphic to H has at least two edges in the same color. We call ar(G,H) the anti- Ramsey number for a pair of graphs (G,
Gorgol Izolda, Lechowska Anna
doaj +1 more source
Clinical Pharmacology &Therapeutics, EarlyView.The NAT2 pharmacogene is essential in drug metabolism, particularly for aromatic amines and hydrazines. Genetic variations in NAT2 categorize individuals as rapid, intermediate, or poor metabolizers based on their acetylation capacity to inform dosing guidelines.
Shobana John +4 more
wiley +1 more source
Connected size Ramsey numbers of matchings versus a small path or cycle
Electronic Journal of Graph Theory and ApplicationsGiven two graphs G1, G2, the connected size Ramsey number rc(G1, G2) is defined to be the minimum number of edges of a connected graph G, such that for any red-blue edge colouring of G, there is either a red copy of G1 or a blue copy of G2. Concentrating
Sha Wang +3 more
doaj +1 more source
Discrete Applied Mathematics, 2009 The graph \(F_n = K_1 + nK_2\) is the Fan graph, and consists of \(n\) triangles sharing a single vertex. It was shown in [\textit{Y. Li} and \textit{C.C. Rousseau}, J. Graph Theory 23, No.\,4, 413--420 (1996; Zbl 0954.05031)] that the Ramsey number \(r(F_1, F_n) = 4n + 1\) for \(n \geq 2\), and this result is extended by showing that \(r(F_2, F_n ...
Qizhong Lin, Yusheng Li 0001
openaire +1 more source