Results 51 to 60 of about 152,670 (312)

2-Colored triangles in edge-colored complete graphs

open access: yesJournal of Combinatorial Theory, Series B, 1978
AbstractIf each edge of complete graph Kn is colored with one of k colors then it contains a triangle having two colors if k < 1 + n12. The result is best possible when n is the square of a prime.
openaire   +2 more sources

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

Coloring problem of signed interval graphs [PDF]

open access: yesTransactions on Combinatorics, 2019
A signed graph $(G,\sigma)$ is a graph‎ ‎together with an assignment of signs $\{+,-\}$ to its edges where‎ ‎$\sigma$ is the subset of its negative edges‎.
Farzaneh Ramezani
doaj   +1 more source

Online detection and grading system for citrus full-surface color

open access: yesShipin yu jixie, 2023
Objective: This study aimed to realize the fast and accurate sorting of citrus color. Methods: An online color detection and grading system of citrus based on machine vision was designed in this study.
LI Lang   +3 more
doaj   +1 more source

Linked dimers of the AAA+ ATPase Msp1 reveal energetic demands and mechanistic plasticity for substrate extraction from lipid bilayers

open access: yesFEBS Letters, EarlyView.
Cells must clear mislocalized or faulty proteins from membranes to survive. The AAA+ ATPase Msp1 performs this task, but dissecting how its six subunits work together is challenging. We engineered linked dimers with varied numbers of functional subunits to reveal how Msp1 subunits cooperate and use energy to extract proteins from the lipid bilayer ...
Deepika Gaur   +5 more
wiley   +1 more source

The role of fibroblast growth factors in cell and cancer metabolism

open access: yesFEBS Letters, EarlyView.
Fibroblast growth factor (FGF) signaling regulates crucial signaling cascades that promote cell proliferation, survival, and metabolism. Therefore, FGFs and their receptors are often dysregulated in human diseases, including cancer, to sustain proliferation and rewire metabolism.
Jessica Price, Chiara Francavilla
wiley   +1 more source

New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling

open access: yesAlgorithms, 2019
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj   +1 more source

Some Results on Palette Index of Cartesian Product Graphs

open access: yesMathematical Problems of Computer Science, 2021
Given a proper edge coloring α of a graph G, we define the palette SG(ν, α) of a vertex ν ∈ V (G) as the set of all colors appearing on edges incident to ν. The palette index š(G) of G is the minimum number of distinct palettes occurring in a proper edge
Khachik S. Smbatyan
doaj   +1 more source

The anti‐CRISPR protein AcrIE8.1 inhibits the type I‐E CRISPR‐Cas system by directly binding to the Cascade subunit Cas11

open access: yesFEBS Letters, EarlyView.
In this study, we present the structure of AcrIE8.1, a previously uncharacterized anti‐CRISPR protein that inhibits the type I‐E CRISPR‐Cas system. Through a combination of structural and biochemical analyses, we demonstrate that AcrIE8.1 directly binds to the Cas11 subunit of the Cascade complex to inhibit the CRISPR‐Cas system.
Young Woo Kang, Hyun Ho Park
wiley   +1 more source

On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2

open access: yesTheory and Applications of Graphs, 2016
An edge coloring of a connected graph G is a proper-path coloring if every two vertices of G are connected by a properly colored path. The minimum number of colors required of a proper-path coloring of G is called the proper connection number pc(G) of G.
Zhenming Bi   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy