Results 121 to 130 of about 43,364 (297)
A characterization of star-perfect graphs
AKCE International Journal of Graphs and CombinatoricsMotivated by Berge perfect graphs, we define star-perfect graphs and characterize them. For a finite simple graph G(V, E), let [Formula: see text] denote the minimum number of induced stars contained in G such that the union of their vertex sets is V(G),
G Ravindra +3 more
doaj +1 more source
The Structure of Claw-Free Perfect Graphs [PDF]
, 2020 In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs.
Matthieu Plumettaz, Maria Chudnovsky
core
Advanced Science, EarlyView.This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo +6 more
wiley +1 more source
Advanced Science, EarlyView.High‐throughput single‐cell analysis of resuscitating bacteria reveals a starvation‐history‐dependent transiently tolerant subpopulation that survives β$\beta$‐lactam exposure by temporarily reducing growth. Distinct from classical persisters, these actively growing yet dynamically modulated cells dominate survival across clinically relevant antibiotic
Kieran Abbott +5 more
wiley +1 more source
New Results on Minimal Strongly Imperfect Graphs [PDF]
Scientific Annals of Computer Science, 2008 The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes
V. Anastasoaei, E. Olaru
doaj
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core
, 1986 Recently, three new families of perfect graphs have given various generalizations of known results: the weakly triangulated graphs, introduced by Hayward [9], the strongly perfect graphs, introduced by Berge and Duchet [2]; the quasi-parity graphs ...
Claude Berge, Berge, Claude
core +1 more source
Advanced Science, EarlyView.Understanding how glomeruli, the kidney's filtration units, function in intact tissue remains challenging. Glomage enables rapid 3D imaging and quantitative analysis of entire glomeruli from zebrafish larvae and mice. This approach allows scalable cell quantification and detection of structural changes, advancing kidney disease research and ...
Maximilian Schindler +4 more
wiley +1 more source
Cross‐Modal Denoising and Integration of Spatial Multi‐Omics Data with CANDIES
Advanced Science, EarlyView.In this paper, we introduce CANDIES, which leverages a conditional diffusion model and contrastive learning to effectively denoise and integrate spatial multi‐omics data. We conduct extensive evaluations on diverse synthetic and real datasets, CANDIES shows superior performance on various downstream tasks, including denoising, spatial domain ...
Ye Liu +5 more
wiley +1 more source