Results 81 to 90 of about 520,977 (330)

Polymer Infiltration Into SURMOF Channels Enables Hydrophobic and Solid‐Like Slippery Functional Thin Films

Advanced Functional Materials, EarlyView.
We report a polymer‐chain insertion strategy to fabricate pore‐threaded MOF thin films with precisely tuned surface chemistry and wettability. Grafting n‐alkane chains into the pillared layer Cu2(bdc)2(dabco) MOF thin film's vertical nanochannels enhances water stability, and induces hydrophobicity and lubricant‐free, solid‐like slippery behavior ...
Angana Borbora, Modan Liu, Hartmut Gliemann, Uttam Manna, Christof Wöll   +4 more
wiley   +1 more source

β-Perfect Graphs

Journal of Combinatorial Theory, Series B, 1996
AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes ofβ-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graphGwith no even chordless cycles using at most 2(χ(G)−1) colours.
Markossian, S.E., Gasparian, G.S., Reed, B.A.   +2 more
openaire   +1 more source

Amyloidogenic Peptide Fragments Designed From Bacterial Collagen‐like Proteins Form Hydrogel

Advanced Functional Materials, EarlyView.
This study identified amyloidogenic sequence motifs in bacterial collagen‐like proteins and exploited these to design peptides that self‐assemble into β‐sheet fibers and form hydrogels. One hydrogel supported healthy fibroblast growth, showing promise for biocompatible materials. Our work demonstrates that bacterial sequences can be harnessed to create
Vamika Sagar, Xuen J Ng, Lukas Lechel, Ashish Chand Rajwar, Hendrik Bargel, Abhishek A. Jalan   +5 more
wiley   +1 more source

Bioprinting Organs—Science or Fiction?—A Review From Students to Students

Advanced Healthcare Materials, EarlyView.
Bioprinting artificial organs has the potential to revolutionize the medical field. This is a comprehensive review of the bioprinting workflow delving into the latest advancements in bioinks, materials and bioprinting techniques, exploring the critical stages of tissue maturation and functionality.
Nicoletta Murenu, Camilla Mussoni, Mateo S. Andrade Mier, Paula Buettner, Nathaly Chicaiza‐Cabezas, Yi‐Yu Robin Dai, Jessica Faber, Maren Fiedler, Zan Lamberger, Xuen Jen Ng, Vanessa Moessler, Anna Rederer, Jonas Roeder, Sabrina Stecher, Katinka Theis, Jeanette Weigelt, Silvia Budday, Gregor Lang, Natascha Schaefer   +18 more
wiley   +1 more source

Generalized Matching Preclusion in Bipartite Graphs

Theory and Applications of Graphs, 2018
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler, Eddie Cheng, Dana Ferranti, Laszlo Liptak, Karthik Nataraj   +4 more
doaj   +1 more source

In Vivo Skin 3‐D Surface Reconstruction and Wrinkle Depth Estimation Using Handheld High Resolution Tactile Sensing

Advanced Healthcare Materials, EarlyView.
A compact handheld GelSight probe reconstructs in vivo 3‐D skin topography with micron‐level precision using a custom elastic gel and a learning‐based surface normal to height map pipeline. The device quantifies wrinkle depth across various body locations and detects changes in wrinkle depth following moisturizer application.
Akhil Padmanabha, Arpit Agarwal, Catherine Li, Austin Williams, Dinesh K. Patel, Sankalp Chopkar, Achu Wilson, Ahmet Ozkan, Wenzhen Yuan, Sonal Choudhary, Arash Mostaghimi, Zackory Erickson, Carmel Majidi   +12 more
wiley   +1 more source

On Perfectness of Annihilating-Ideal Graph of $\mathbb{Z}_n$ [PDF]

, 2021
Manideepa Saha, Sucharita Biswas, Angsuman Das   +2 more
openalex   +1 more source

Circular perfect graphs [PDF]

Journal of Graph Theory, 2005
AbstractFor 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k − 1, in which i ∼j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is
openaire   +1 more source

Start, Stop, Rewind, Repeat—Cyclic Exposure of Adipose Stromal Cells‐derived Cartilage Organoids to Chondrogenic and Proliferative Cues to Achieve Scaled‐up and Customizable Bone Formation by Endochondral Ossification

Advanced Healthcare Materials, EarlyView.
This study exploits the plasticity of ASCs‐derived cartilage organoids which generate a perichondrial layer of MSCs when exposed to cyclic chondrogenic/proliferative cues. Using these organoids as building blocks, we develop (i) Phalange Shaped Tissue Engineered Cartilage (Pa‐TECs), recapitulating endochondral ossification suitable for the treatment of
Pablo Pfister, Emilien Lhospice, Andrés García‐García, Robert Paillaud, Sebastian Jung, Romain Schaller, Elisabeth A. Kappos, Claude Jaquiéry, Tarek Ismail, Dirk J. Schaefer, Michael de Wild, Ivan Martin, Alexandre Kaempfen, Arnaud Scherberich, Adrien Moya   +14 more
wiley   +1 more source

Coloring of graph of ring with respect to idempotents [PDF]

Mathematica Bohemica
Let $R$ be a ring with nonzero identity. A graph $G_{{\rm Id}}(R)$ of $R$ with respect to idempotents of $R$ has elements of $R$ as vertices and distinct vertices $x$, $y$ are adjacent if and only if $x + y$ is an idempotent of $R$.
Avinash Patil, Dipika Patil
doaj   +1 more source