Results 61 to 70 of about 3,311 (246)

On chordal proper circular arc graphs

Discrete Mathematics, 1994
A graph is an interval (circular arc) graph if it is the intersection graph of a family of intervals (arcs) on the real line (a circle). An interval (circular arc) graph is proper if the family of intervals (arcs) can be chosen to be inclusion-free. In the paper it is shown that a chordal graph is a proper interval graph if and only if it is claw-free,
Jørgen Bang-Jensen, Pavol Hell
openaire   +1 more source

Side Chain Elimination Enables Low‐Cost Fused‐Ring Acceptors and Reveals a Compact Tetrameric Structure for High‐Photocurrent Organic Solar Cells

Advanced Science, EarlyView.
β‐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, Yi Wu, Witold M. Bloch, Caroline V. I. Andersson, Leandro R. Franco, Rafael B. Ribeiro, Chuangcheng Hong, Wei Zhang, Xun Pan, Joost Kimpel, Christian Müller, Zhicai He, Bin Zhang, Ergang Wang, Mats R. Andersson   +14 more
wiley   +1 more source

Multi‐Axis Stretchable Zippers for Personalized Wound Healing

Advanced Science, EarlyView.
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, Guang Yao, Zijian Chen, Shiqi Zhou, Peisi Li, Liheng Lin, Huake Yang, Ziyi Zhou, Linbo Jin, Xingyi Gan, Chenzheng Zhou, Zhen Cai, Taisong Pan, Min Gao, Dongli Fan, Yuan Lin, Yiming Zhang   +16 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

, 2007
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, Ng, CTD, Ng, C.T., Cheng, T.C.E., Kang, L.Y., Kang, L   +5 more
core   +1 more source

On the approximability of the maximum induced matching problem [PDF]

, 2005
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, David F. Manlovey, Zito, M., M. Zito, D. Manlove, Michele Zitoz, Duckworth, William, Manlove, D.F., W. Duckworth, Manlove, David F., Duckworth, W., William Duckworth, Manlove, David F   +12 more
core   +1 more source

Generation of Self‐Organizing Macrovascular Constructs by Bioprinting Human iPSC‐Derived Mesodermal Progenitor Cells

Advanced Science, EarlyView.
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, Nathaly A. Chicaiza‐Cabezas, Florian Kleefeldt, Philipp Wörsdörfer, Jürgen Groll, Süleyman Ergün   +5 more
wiley   +1 more source

Hadwiger's Conjecture On Circular Arc Graphs

, 2007
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  

Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace [PDF]

, 2012
We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models.
Kuhnert, Sebastian, Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky, Köbler, Johannes, Verbitsky, Oleg   +5 more
core   +1 more source

Multiferroic‐Centric Materials and Systems Engineering for Battery Applications: An Insight Into Mechanisms, Strategies, and Characterizations

Advanced Science, EarlyView.
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, Yanda Zhu, Hao Peng, Manman Li, Xuzihan Zhang, Meixiao Wu, Siyuan Zhang, Yuhan Zeng, Jiwen Liao, Ming Luo, Hetaishan Huang, Yutong Wang, Sean Li, Wenxian Li   +13 more
wiley   +1 more source