Results 111 to 120 of about 153,059 (312)
A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs [PDF]
, 2016 Gabriela Araujo‐Pardo +1 more
openalex +1 more source
A general model for analysis of linear and hyperbolic enzyme inhibition mechanisms
FEBS Open Bio, EarlyView.We developed a general enzyme kinetic model that integrates these six basic inhibition mechanism onto a single one. From this model, we deduced a general enzyme kinetic equation that through modulation of simple parameters, γ (the relative inhibitor affinity for two binding sites) and β (the reactivity of the enzyme–substrate–inhibitor complex), is ...
Rafael S. Chagas, Sandro R. Marana
wiley +1 more source
International Journal of Fruit ScienceColoring is an important external quality of apples. Commercial apple varieties are bagged before the fruits ripen to ensure they grow in a pesticide-free environment, including preventing mechanical damage, reducing sunburn, etc.
Pengwei Duan +6 more
doaj +1 more source
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +1 more source
Interval Total Colorings of Complete Multipartite Graphs and Hypercubes [PDF]
, 2014 Petros A. Petrosyan +1 more
openalex +1 more source
Homologous expression and purification of human HAX‐1 for structural studies
FEBS Open Bio, EarlyView.This research protocol provides detailed instructions for cloning, expressing, and purifying large quantities of the intrinsically disordered human HAX‐1 protein, N‐terminally fused to a cleavable superfolder GFP, from mammalian cells. HAX‐1 is predicted to undergo posttranslational modifications and to interact with membranes, various cellular ...
Mariana Grieben
wiley +1 more source
Kaleidoscopic Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2017 For an r-regular graph G, let c : E(G) → [k] = {1, 2, . . . , k}, k ≥ 3, be an edge coloring of G, where every vertex of G is incident with at least one edge of each color.
Chartrand Gary, English Sean, Zhang Ping
doaj +1 more source
FEBS Open Bio, EarlyView.Comparative analysis of chloroplast genomes from 14 genera of Thymelaeaceae revealed variation in gene content, ranging from 128 to 142 genes, primarily influenced by IR expansion/contraction events and pseudogenization of ndhF, ndhI, and ndhG. Two large inversions were detected within the large single‐copy region, including a synapomorphic inversion ...
Abdullah +8 more
wiley +1 more source
FEBS Open Bio, EarlyView.This study addressed how a senior research thesis is perceived by undergraduate students. It assessed students' perception of research skills, epistemological beliefs, and career goals in Biochemistry (science) and BDC (science‐business) students. Completing a thesis improved confidence in research skills, resilience, scientific identity, closed gender‐
Celeste Suart +4 more
wiley +1 more source
Multiplicity of triangles in complete graphs with -holes
AKCE International Journal of Graphs and Combinatorics, 2019 Let be the family of graphs where is obtained from the complete graph by removing the edges of vertex disjoint copies of triangles. In this paper, we determine the multiplicity of triangles in any two coloring of the edges of when .
S.S. Rukmani, J. Prema, V. Vijayalakshmi
doaj +1 more source