Results 61 to 70 of about 6,072 (265)
Capacitated Partition Vertex Cover and Partition Edge Cover
Our first focus is the Capacitated Partition Vertex Cover (C-PVC) problem in hypergraphs. In C-PVC, we are given a hypergraph with capacities on its vertices and a partition of the hyperedge set into $ω$ distinct groups. The objective is to select a minimum size subset of vertices that satisfies two main conditions: (1) in each group, the total number ...
Rajni Dabas +2 more
openaire +2 more sources
Note on vertex-partitions of infinite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
János Pach, Joel H. Spencer
openaire +1 more source
Hydrogel‐Based Airway‐on‐Tube With Perfusable Endothelial Lumen and Outward Epithelialization
A hydrogel‐based airway‐on‐tube platform featuring a perfusable endothelial lumen and outward epithelialization is presented. The system supports primary human bronchial epithelial and lung microvascular endothelial coculture under air‐liquid interface conditions.
Ali Doryab +8 more
wiley +1 more source
Compactified webs and domain wall partition functions
In this paper we use the topological vertex formalism to calculate a generalization of the “domain wall” partition function of M-strings. This generalization allows calculation of partition function of certain compactified webs using a simple gluing ...
Khurram Shabbir
doaj +1 more source
Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 more
wiley +1 more source
The upper domatic number of a graph
Let be a graph. For two disjoint sets of vertices and , set dominates set if every vertex in is adjacent to at least one vertex in . In this paper we introduce the upper domatic number , which equals the maximum order of a vertex partition such that for ...
Teresa W. Haynes +4 more
doaj +1 more source
Approximation algorithms for the partition vertex cover problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suman Kalyan Bera +3 more
openaire +2 more sources
E. coli Extracellular Matrix: A Tunable Composite With Hierarchical Structure
The complex composite‐like mechanical behavior of E. coli biofilm matrix is the result of a synergic contribution of the rigid curli and swelling pEtN‐cellulose, and emerges from specific ratio and assembly conditions. The interactions between the two fibers govern biofilm hydration and characteristic wrinkling patterns, providing crucial insights for ...
Macarena Siri +7 more
wiley +1 more source
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj +1 more source
In this work, we introduce ancillary‐ligand‐mediated growth control of ultrathin CsPbI3 PeNPLs to achieve highly uniform thickness and reduced agglomeration. Strong ancillary‐ligand coordination to the perovskite surface regulates nucleation and improves surface passivation, enabling color‐pure emission and preferentially oriented superlattices.
Jongbeom Kim +23 more
wiley +1 more source

