Results 121 to 130 of about 757,662 (296)
Molecular Bridges for 2D Nanomaterials
Advanced Functional Materials, EarlyView.Molecular cross‐linking provides a versatile strategy to engineer interfaces in 2D materials. By tuning the linker backbone, binding mode, and interflake spacing, molecular bridges can regulate charge transport, mechanical integrity, chemical functionality, and processing.
Yudhajit Bhattacharjee +3 more
wiley +1 more source
Min-$k$-planar Drawings of Graphs
Journal of Graph Algorithms and ApplicationsThe study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing.
Carla Binucci +9 more
doaj +1 more source
Stack and Queue Layouts via Layered Separators
Journal of Graph Algorithms and Applications, 2018 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not
Vida Dujmović, Fabrizio Frati
doaj +1 more source
Computational Geometry, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Ferran Hurtado
openaire +2 more sources
Advanced Functional Materials, EarlyView.Bioinspired Bouligand architectures are translated into biodegradable polymer laminates with integrated sensing, revealing how structural design governs multifunctional performance. A 20° interlayer rotation optimizes strength, flexibility, and electromechanical response, while embedded nanotube networks enable real‐time damage detection and wearable ...
Piotr K. Szewczyk +4 more
wiley +1 more source
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
Discrete Mathematics, 1974 AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order to separate any two circuits of G. If G is cyclically n-connected but any separation of G by cutting n edges yields a component consisting of a simple circuit, then we say that G is strongly cyclically n-connected.
openaire +2 more sources
Advanced Functional Materials, EarlyView.This study explored how innovative “auxetic” scaffolds, which expand when stretched, influence skeletal muscle development. Researchers cultured muscle cells on different scaffold designs and applied repeated stretching over 10 days. They found that scaffold geometry affected muscle cell differentiation and fiber formation.
Maria Kalogeropoulou +5 more
wiley +1 more source
An Overlooked Transport Mechanism in Organic Mixed Conductors
Advanced Functional Materials, EarlyView.Electrical transport in organic mixed ionic‐electronic conductors is commonly described by ionic and electronic conduction. Here, eumelanin reveals that polarization‐assisted displacement currents constitute an additional transport component that coexists with conductive transport.
Natan L. Nozella +5 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core