Results 81 to 90 of about 18,159 (263)

Swelling‐Programmed Topographical Guidance for Dynamic Spheroid Self‐Assembly via a Mechanochemical Hydrogel Niche

Advanced Functional Materials, EarlyView.
A swelling‐programmed micropatterned hydrogel guides adherent cells through a controlled transition from cell–matrix anchoring to cadherin‐mediated cell–cell compaction, enabling rapid assembly of high‐viability spheroids with defined size and morphology.
Han Gyeol Nam, Seon Yeong Chae, Young Woo Kwon, Hye Jin Heo, Hye Rin Lee, Ji Hyeok Lee, Dong‐Wook Han, Yun Hak Kim, Suck Won Hong   +8 more
wiley   +1 more source

Beyond Outerplanarity

Computing in Geometry and Topology
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff   +4 more
doaj   +1 more source

Testing Simultaneous Planarity when the Common Graph is 2-Connected

Journal of Graph Algorithms and Applications, 2013
Two planar graphs G1 and G2 sharing some vertices and edges are simultaneously planar if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings.
Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw   +2 more
doaj   +1 more source

A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. [PDF]

Comput Intell Neurosci, 2021
Liang Z, Wei H.
europepmc   +1 more source

Flips in planar graphs

Computational Geometry, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Ferran Hurtado
openaire   +1 more source

Intrinsic Photoactive Star ZnPc–Poly(glutamate) Nanoplatforms for Multimodal Glioblastoma Therapy and Brain‐Targeted Delivery

Advanced Functional Materials, EarlyView.
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández, Teodora Ranđelović, Ana Armiñán, Víctor Sebastián, Manuel Fuentes, Cristián Huck‐Iriart, Esther Masiá, Paula Carrascosa‐Marco, Pablo Juanes‐Velasco, Snežana Đorđević, Clara Bayona, Ignacio Ochoa, Maria Medel, Inmaculada Conejos‐Sánchez, María J. Vicent   +14 more
wiley   +1 more source

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Discussiones Mathematicae Graph Theory, 2014
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj   +1 more source

Structure‐Guided Dynamical Mechanics in Bioinspired Double Twisted Laminated Thin Films

Advanced Functional Materials, EarlyView.
This work explores a dynamic mechanistic study of crack propagation and puncture testing via real‐time monitoring of crack initiation, propagation, and termination through nature‐inspired single and double twisted architectures fabricated from cellulose nanocrystals.
Justin Brackenridge, Olivia Harper, Jaejun Lee, Sergio Gonzalez‐Munoz, Vladimir V. Tsukruk   +4 more
wiley   +1 more source

Recursive generation of simple planar 5-regular graphs and pentangulations

Journal of Graph Algorithms and Applications, 2011
We describe how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an amalgam of theory and computation.
Mahdieh Hasheminezhad, Brendan McKay, Tristan Reeves   +2 more
doaj   +1 more source

Decomposing a Planar Graph into Degenerate Graphs

Journal of Combinatorial Theory, Series B, 1995
A graph \(G\) is \(k\)-degenerate if every subgraph of \(G\) has a vertex of degree less than \(k\). The author proves that the vertex set of any planar graph can be decomposed into two sets such that one of them induces a 3-degenerate graph and the other induces a 2-degenerate graph.
openaire   +2 more sources