Results 81 to 90 of about 145,499 (286)

Biodegradable and Recyclable Luminescent Mixed‐Matrix‐Membranes, Hydrogels, and Cryogels based on Nanoscale Metal‐Organic Frameworks and Biopolymers

open access: yesAdvanced Functional Materials, EarlyView.
The study presents biodegradable and recyclable mixed‐matrix membranes (MMMs), hydrogels, and cryogels using luminescent nanoscale metal‐organic frameworks (nMOFs) and biopolymers. These bio‐nMOF‐MMMs combine europium‐based nMOFs as probes for the status of the materials with the biopolymers agar and gelatine and present alternatives to conventional ...
Moritz Maxeiner   +4 more
wiley   +1 more source

WORM Colorings of Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj   +1 more source

Bar 1-Visibility Drawings of 1-Planar Graphs

open access: yes, 2013
A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean   +13 more
core   +1 more source

Laser‐Induced Graphene from Waste Almond Shells

open access: yesAdvanced Functional Materials, EarlyView.
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

Triangle Decompositions of Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e of G, the sum
Mynhardt Christina M.   +1 more
doaj   +1 more source

Bipartite Minors [PDF]

open access: yes, 2013
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor.
Chudnovsky, Maria   +4 more
core   +1 more source

MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance

open access: yesAdvanced Functional Materials, EarlyView.
Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley   +1 more source

Uniform random sampling of planar graphs in linear time [PDF]

open access: yes, 2007
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

An All‐Optical Driven Bio‐Photovoltaic Interface for Active Control of Live Cells

open access: yesAdvanced Functional Materials, EarlyView.
Bio‐photovoltaic Interface (BIO‐PV‐I) for live cell manipulation is presented. BIO‐PV‐I can be activated non‐invasively and remotely to control the spatial motility, adhesion, and morphology of cells adhering to it. BIO‐PV‐I uses a patterned light‐induced electric potential in iron‐doped lithium niobate crystals whose light‐driven and reversible nature,
Lisa Miccio   +8 more
wiley   +1 more source

Recognizing and Drawing IC-planar Graphs

open access: yes, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer   +27 more
core   +1 more source

Home - About - Disclaimer - Privacy