Results 51 to 60 of about 3,875,937 (262)
Geometric biplane graphs I: maximal graphs [PDF]
We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs.
Garcia Olaverri, Alfredo Martin +7 more
core +2 more sources
Ti6Al4V‐Bioglass‐Copper Composites for Load‐Bearing Implants
We have designed and manufactured a novel Ti64‐based composite by adding 45S5 bioglass (BG) and copper (Cu). Adding BG on titanium improves wear resistance and biocompatibility, whereas Cu addition improves mechanical strength while providing inherent lifelong bacterial resistance.
Lochan Upadhayay +3 more
wiley +1 more source
AASLD practice guidance on drug, herbal, and dietary supplement–induced liver injury
Hepatology, EarlyView.
Robert J. Fontana +6 more
wiley +1 more source
To Prove Four Color Theorem [PDF]
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to color and test
Cao, Weiwei, Yue, Weiya
core
On Optimal 2- and 3-Planar Graphs [PDF]
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized, this has not ...
Bekos, Michael A. +2 more
core +2 more sources
By integrating single‐nuclei and spatial transcriptomics, this study presents a stereoscopic landscape of maize leaf to Puccinia polysora infection. Epidermal and mesophyll cells initiate primary defenses via RLPs/RLKs and jasmonic acid signaling. Cell‐cell communication analyses further reveal the underlying the dynamics of the underlying immune ...
Qiongqiong Wang +16 more
wiley +1 more source
Geometric biplane graphs II: graph augmentation [PDF]
We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-
Garcia Olaverri, Alfredo Martin +7 more
core +2 more sources
Parameterized Algorithms for Book Embedding Problems [PDF]
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross.
S. Bhore +3 more
semanticscholar +1 more source
This paper reviews the physics of liquid metals in RF devices, including the influence of mechanical strain on resonance as well as fabrication methods and strategies for designing tunable and strain‐tolerant inductors, capacitors, and antennas.
Md Saifur Rahman, William J. Scheideler
wiley +1 more source
On the Book Thickness of 1-Planar Graphs
In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page do not cross each other. The minimum number of pages in which a graph can be embedded is called the book-thickness
Alam, Md. Jawaherul +2 more
openaire +2 more sources

