Results 61 to 70 of about 7,309 (246)
On some subclasses of circular arc-graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc ...
Guillermo Durán, Min Chih Lin
core
Blocking quadruple : a new obstruction to circular-arc graphs
Finding a forbidden subgraph characterization of circular-arc graphs is a challenging open problem. Many partial results toward this goal have been proposed over the years, but a satisfactory answer has so far eluded us.
Francis, Mathew +2 more
core +1 more source
β‐side chain elimination enables cost‐effective fused‐ring acceptors, JSM5 and JSM6, with simplified synthesis. The observed compact tetrameric structures induced by S···N intermolecular interactions lead to 3D charge transport and enhance intermolecular connectivity, delivering high short‐circuit current density up to 28 mA cm−2, a step closer to the ...
Jinhui Zhao +14 more
wiley +1 more source
Multi‐Axis Stretchable Zippers for Personalized Wound Healing
Multi‐axis stretchable zippers can adapt to complex wound morphologies and enable personalized wound treatment through programmable contraction. This morphological matching strategy helps accelerate wound closure, improve blood perfusion, promote epithelial regeneration, and enhance collagen remodeling, pioneering new directions for personalized and ...
Siyuan Cai +16 more
wiley +1 more source
ABSTRACT Vascularization remains a major obstacle in tissue engineering. Here, we introduce a bioprinting strategy to generate centimeter‐scale, self‐organizing “mother vessel” constructs from iPSC‐derived hiMPCs. By optimizing bioink composition, printing was accomplished in a single‐step approach. Within one week, hiMPCs differentiated into both CD31+
Leyla E. Dogan +5 more
wiley +1 more source
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
Paired domination on interval and circular-arc graphs
We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m+n) time algorithm to solve the paired-domination problem on interval graphs.
Cheng, TCE +5 more
core +1 more source
On the approximability of the maximum induced matching problem [PDF]
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Multiferroic order parameters – polarization, magnetization, and ferroelastic strain – are positioned as dynamic design variables for batteries. Their mechanistic roles, practical tuning through fabrication and external fields, and ferroic‐resolved characterization routes are unified into a closed‐loop framework, revealing how coupled ferroic responses
Jiaqi Su +13 more
wiley +1 more source
Hadwiger's Conjecture On Circular Arc Graphs
Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at least k.
Belkale, Naveen
core

