Results 81 to 90 of about 1,379,637 (289)
Choosability in signed planar graphs [PDF]
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \in \{3,4,5,6\}$, every signed planar graph without circuits of length $k$ is 4-choosable.
arxiv
Influence of Form and Structural Features of Open‐Cell Hybrid Foam on the Remanent Magnetic Scanning
Simulations using an equivalent model are performed to improve the understanding of remanent magnetic scanning of hybrid foam samples for coating thickness estimation. The model allows to study the influence of isolated geometrical features such as layer thickness, boundary effects, as well as effects due to the statistical nature of the foams, which ...
Bashar Ibrahim+4 more
wiley +1 more source
Dualizing Distance-Hereditary Graphs
Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source
On self-approaching and increasing-chord drawings of 3-connected planar graphs [PDF]
An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t' on the curve the distance to t' is non-increasing. A path has increasing chords if it is self-approaching in both directions. A
M. Nöllenburg+2 more
semanticscholar +1 more source
Triangulating planar graphs while keeping the pathwidth small [PDF]
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without increasing the pathwidth by much. We show that if a planar graph has pathwidth $k$, then we can triangulate it so
arxiv
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Deformation Behavior of La2O3‐Doped Copper during Equal Channel Angular Pressing
By additions of strengthening elements and/or structure optimization, the mechanical properties of copper can be increased while keeping favorable electric conductivity. By combining addition of La2O3 and processing by equal channel angular pressing, substructure development is achieved, leading to increase in microhardness to more than double the ...
Lenka Kunčická+2 more
wiley +1 more source
On the Planar Edge-Length Ratio of Planar Graphs [PDF]
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph.
arxiv
This study examines the mechanical properties of triply periodic minimal surfaces (TPMS)‐based lattices, analyzing 36 architectures in elastic and plastic regimes. It evaluates the applicability of beam‐based scaling laws to TPMS lattices. Rigidity arises from the alignment of members with the load direction and solid regions preventing rotation.
Lucía Doyle+2 more
wiley +1 more source
This study explores aerosol jet‐printed (AJP) surface roughness, its effects on the performance of microwave electronics, and its process contributors. First, an electromagnetic model is vetted for AJP's unique roughness signature. Simulations are built which show process‐induced roughness is as significant as conductor resistivity in driving microwave
Christopher Areias, Alkim Akyurtlu
wiley +1 more source