Results 71 to 80 of about 43,364 (297)
Human periosteum‐derived cell spheroids bioprinted at high density within a hyaluronic acid matrix promote fusion and hypertrophic cartilage formation in vitro. Early encapsulation enhances spheroid interaction and matrix maturation, generating scalable cartilage templates intended for endochondral bone regeneration.
Ane Albillos Sanchez +6 more
wiley +1 more source
Perfect Matchings in Random Octagonal Chain Graphs
A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G. In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the ...
Shouliu Wei +4 more
doaj +1 more source
Gonzalez Martinez and collaborators develop a strategy to formulate high performance GelMA‐based bioinks with low solids contents. The resulting bioinks enable 3D bioprinting at 37 °C of high‐fidelity structures with tunable mechanical properties that support high cell viability and function.
David A. González‐Martínez +8 more
wiley +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source
Perfection thickness of graphs
For a graph \(G\), let \(f(G)\) be the least number of perfect subgraphs of \(G\) whose union is \(G\). Let \(f(n)= \max\{f(G):|V(G)|= n\}\). Improving results of Zs. Tuza, the authors prove that \[ \textstyle{{1\over 2}}(\log n-\log\log n- O(1))\leq f(n)\leq \lceil\log n\rceil, \] where \(\log\) denotes the base-2 logarithm.
Hirotsugu Asari +3 more
openaire +2 more sources
Triangle-Free Strongly Circular-Perfect Graphs [PDF]
International audienceZhu introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G)≤ω(G)+1.
Annegret K. Wagler +5 more
core +1 more source
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core

