Results 71 to 80 of about 30,716 (267)
Computing in Geometry and TopologyWe 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 +4 more
doaj +1 more source
Fabrication Routes for Ionic Conducting Fiber Strain Sensors
Advanced Engineering Materials, EarlyView.Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw +3 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.Despite benefits to storage stability and handleability of aluminum scrap, octadecyl phosphonic acid (ODPA) SAMs reduce the tensile strength of wires produced using friction‐induced recycling. Etching and methyl diphosphonic acid (MDPA) coatings, however, have little effect.
Timothy D. Goller +3 more
wiley +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced 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
Journal of Combinatorial Theory, Series B, 1998 Given four distinct vertices in a 4-connected planar graph \(G\), we characterize when the graph \(G\) contains a \(K_4\)-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no \(K_4\)-subdivision with specified degree three vertices, if ...
openaire +2 more sources
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
Journal of Graph Algorithms and Applications, 2004 We give an algorithm for isomorphism testing of planar graphs suitable for practical implementation. The algorithm is based on the decomposition of a graph into biconnected components and further into SPQR-trees.
Jacek Kukluk +2 more
doaj +1 more source
Advanced Functional Materials, EarlyView.ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
Posets and planar graphs [PDF]
Journal of Graph Theory, 2005 AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +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 +4 more
wiley +1 more source
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +3 more sources