Results 111 to 120 of about 4,115 (305)
Aqueous Two‐Phase Bioinks for Discrete Packing and Compartmentalization of 3D Bioprinted Cells
Advanced Healthcare Materials, EarlyView.Aqueous two‐phase systems (ATPS) enable the formation of biomimetic interfaces crucial for tissue engineering. However, clinical translation remains limited by the challenge of precisely controlling cellular compartmentalization. Here, we developed ATPS biomaterial inks for 3D bioprinting allowing tuneable droplet formation via NaCl modulation.
Martina Marcotulli +17 more
wiley +1 more source
Extremal regular graphs of given chromatic number
, 2023 We define an extremal $(r|\chi)$-graph as an $r$-regular graph with chromatic number $\chi$ of minimum order. We show that the Tur{\' a}n graphs $T_{ak,k}$, the antihole graphs and the graphs $K_k\times K_2$ are extremal in this sense.
Rubio-Montiel, Christian
core +1 more source
Advanced Healthcare Materials, EarlyView.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
Advanced Materials, EarlyView.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
Two Short Proofs on Total Domination
Discussiones Mathematicae Graph Theory, 2013 A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
Advanced Materials, EarlyView.This review highlights the role of self‐assembled monolayers (SAMs) in perovskite solar cells, covering molecular engineering, multifunctional interface regulation, machine learning (ML) accelerated discovery, advanced device architectures, and pathways toward scalable fabrication and commercialization for high‐efficiency and stable single‐junction and
Asmat Ullah, Ying Luo, Stefaan De Wolf
wiley +1 more source
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Discussiones Mathematicae Graph Theory, 2014 A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex.
Wang Dingguo, Shan Erfang
doaj +1 more source
, 2013 A graph G is singular if the zero-one adjacency matrix has the eigenvalue zero. The multiplicity of the eigenvalue zero is called the nullity of G. For two vertices y and z of G, we call (G, y, z) a device with respect to y and z. The nullities of G, G − y, G − z and G − y − z classify devices into different kinds.
Borg, Martha +4 more
openaire +2 more sources
On a problem in extremal graph theory
Journal of Combinatorial Theory, Series B, 1977 From the authors introduction. Let \(G(n,m)\) denote a graph \((V,E)\) with \(n\) vertices and \(m\) edges and \(K_1\) a complete graph with \(i\) vertices. \textit{P.Turán} proved that every \(G(n,T(n,k))\) contains a \(K_k\), where \[ T(n,k) = \frac{k-2}{2(k-1)}(n^2-r^2)+\binom r2+1, \] \(r\equiv n(\mod k-1)\) and \(0\leq r\leq k-2\).
D. T. Busolini, Paul Erdös
openaire +1 more source
Results in Extremal Graph Theory, Ramsey Theory and Additive Combinatorics
, 2020 This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a central problem in Extremal Graph Theory. The extremal number (or Turán number) ex(n,H) of a graph H is the maximum number of edges in an H-free graph on
core +1 more source