Results 91 to 100 of about 151,154 (334)
Hybrid nanogenerator (HNG) based on a zinc‐metal‐organic framework‐loaded fibrous film integrated with a hierarchically modified nylon film having micropatterns and micropores is fabricated via an electrospinning technique, and its electrical properties are optimized. The HNGs are incorporated into wearable garments and automobile systems for practical
Sontyana Adonijah Graham +6 more
wiley +1 more source
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods [PDF]
Igor Fabrici +3 more
openalex +1 more source
Random graphs from a weighted minor-closed class [PDF]
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs.
McDiarmid, Colin
core
Laser‐Induced Graphene from Waste Almond Shells
Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
Double Helical Plasmonic Antennas
Plasmonic double helical antennas funnel circularly polarized light to the nanoscale, offering strong chiroptical interaction and directional light emission. Extending a single helix design tool, this study combines numerical modeling with experimental validation, revealing large, broadband dissymmetry factors in the visible range.
Aleksei Tsarapkin +7 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. [PDF]
Liang Z, Wei H.
europepmc +1 more source
Uniform random sampling of planar graphs in linear time [PDF]
This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer.
Fusy, Eric
core +6 more sources
This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou +4 more
wiley +1 more source
Random planar maps and graphs with minimum degree two and three [PDF]
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes.
Noy, Marc, Ramos, Lander
core +2 more sources

