Results 41 to 50 of about 587,547 (217)
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
Advanced Science, EarlyView.The pre‐regenerative vascular niche (PVN) is essential for nerve repair, yet its endothelial blueprint remains unclear. We identified angiogenic ECs (AECs) as the dominant pre‐regenerative subset and found that antler blood–derived exosomes (AB‐EXO) promote repair via IMP3.
Jinsheng Huang +11 more
wiley +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Advanced Science, EarlyView.A mitochondria‐targeted, microenvironment‐responsive nanoplatform enables pH/ROS‐triggered co‐delivery of berberine and isoliensinine to orchestrate ROS scavenging, inflammation suppression, and apoptosis inhibition. This vertical modulation of mitochondrial pathological networks preserves mitochondrial function and effectively mitigates myocardial ...
Jue Wang +11 more
wiley +1 more source
On minimally tough chordal graphs [PDF]
, 2023 Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough. We conjecture that no chordal graph is minimally $t$-tough for $t>1/2$ and prove several results supporting the conjecture.
Varga, Kitti +4 more
core +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Deconstruction of Human Age‐Related Cataract Capsules Defines Aging
Advanced Science, EarlyView.We generate a comprehensive atlas of age‐related cataracts (ARC) at a single‐cell resolution, encompassing three disease states—mild cataract group (Mild), severe cortical cataract group (Severe_C), and severe nuclear cataract group (Severe_N). We find that ARC involves seven distinct lens capsule cell types, with notable differences in cellular ...
Qiaomei Tang +9 more
wiley +1 more source
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil\frac{|V(G)|}{k}\rceil$ vertices.
Aijun Dong, Jianliang Wu
doaj +1 more source
Advanced Science, EarlyView.Furrow tillage resolves the conventional‐vs.‐no‐tillage trade‐off by simultaneously cutting CO2 efflux to 2.0–3.0 g C m−2 d−1 and unlocking high nutrient availability for the rice rhizosphere. This scalable agronomic solution strengthens soil health, enhances plant physiology, reshapes microbial metabolism, and shifts paddy systems toward a net ...
Arnab Majumdar +10 more
wiley +1 more source