Results 51 to 60 of about 12,115 (251)

Graphs of Bounded Chordality

open access: yesThe Electronic Journal of Combinatorics
 A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Chaniotis, Aristotelis   +2 more
openaire   +2 more sources

On the shelling antimatroids of split graphs [PDF]

open access: yesDiscrete 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

Clique cutsets beyond chordal graphs [PDF]

open access: yesElectronic Notes in Discrete Mathematics, 2017
Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed.
Boncompagni, V, Penev, I, Vušković, K
openaire   +5 more sources

Implementation of Drug‐Induced Rhabdomyolysis and Acute Kidney Injury in Microphysiological System

open access: yesAdvanced Functional Materials, EarlyView.
A modular Muscle–Kidney proximal tubule‐on‐a‐chip integrates 3D skeletal muscle and renal proximal tubule tissues to model drug‐induced rhabdomyolysis and acute kidney injury. The coculture system enables dynamic tissue interaction, functional contraction monitoring, and quantification of nephrotoxicity, revealing drug side effect‐induced metabolic ...
Jaesang Kim   +4 more
wiley   +1 more source

Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]

open access: yesDiscrete 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

A Microphysiological Interface of Skeletal Myobundles and Inflamed Adipose Tissue for Recapitulating Muscle Dysfunction in an Obese Microenvironment

open access: yesAdvanced Healthcare Materials, EarlyView.
A human cell‐based microphysiological system integrates engineered muscle tissues with an inflamed adipose–macrophage niche to model obese microenvironment‐induced muscle dysfunction. Muscle contraction is quantified by pillar deflection coupled with computational stiffness estimation. Secretome and transcriptomic profiling reveal inflammation‐mediated
Seunggyu Kim   +16 more
wiley   +1 more source

3-Colourability of Dually Chordal Graphs in Linear Time [PDF]

open access: yes, 2012
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core  

Giga‐Voxel Multiscale Composite Architecture Mirrored Through a Data‐to‐Model Closed‐Loop Digital Twin

open access: yesAdvanced Materials, EarlyView.
Herein, a systematic digital twin workflow tailored for generating high‐fidelity virtual representations of anisotropic composite microstructures and giga‐voxel meso‐structural models is presented, leveraging a harmonious integration of top–down image‐based modeling and bottom–up data‐driven voxel generation.
Siwon Yu   +7 more
wiley   +1 more source

On an edge partition and root graphs of some classes of line graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2017
The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj   +1 more source

Tie2‐Dependent Mechanisms Influence Leptomeningeal Collateral Dynamics and Reperfusion Following Stroke

open access: yesAdvanced Science, EarlyView.
This work demonstrates that endothelial EphA4 limits Tie2 activation and curbs leptomeningeal collateral expansion after ischemic stroke. Pharmacological activation of Tie2 by an Ang‐1 mimetic or genetic loss of EphA4 stimulates collateral vessel growth, improves cerebral perfusion, and enhances neurological recovery.
Alexandra M. Kaloss   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy