Results 91 to 100 of about 1,484,168 (305)
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig +2 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose, Ferran Hurtado
openaire +2 more sources
Design of a Multistable Finger Prosthesis with Programmable Metamaterials
This research article shows the development of a multistable programmble metamaterial for the use as a finger prosthesis. The material was designed on different hierarchical levels where the influence of geometrical parameters and combination of mechanical elements was explored.
Franziska Wenz +5 more
wiley +1 more source
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
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
Decomposing a Planar Graph into Degenerate Graphs
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 +3 more sources
On the reconstruction of planar graphs
AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski +2 more
openaire +1 more source
P4bm framework in NaNbO3‐Ba(Ti, Hf)O3 ferrodistortive relaxor entails short‐range and highly‐polar ferrodistortive orders. The abundant highly‐polar orders facilitate to increase entropy change, and robust octahedral oxygen tilt enables to impede thermal perturbations.
Feng Li +11 more
wiley +1 more source
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 +8 more
wiley +1 more source

