Results 71 to 80 of about 151,154 (334)
A wood‐based magnetic and conductive material called Magwood (MW), capable of blocking almost 99.99% of electromagnetic waves (in the X‐band frequency range), is synthesized using a simple, solvent‐free process. MW is lightweight, resists water, and is flame‐retardant, making it a promising alternative for shielding electronics. The rapid proliferation
Akash Madhav Gondaliya +3 more
wiley +1 more source
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable [PDF]
For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors.
Marthe Bonamy +2 more
doaj +1 more source
Construction and Analysis of Queuing and Reliability Models Using Random Graphs
In this paper, the use of the construction of random processes on graphs allows us to expand the models of the theory of queuing and reliability by constructing.
Gurami Tsitsiashvili
doaj +1 more source
PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
Strip Planarity Testing for Embedded Planar Graphs [PDF]
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G(V,E)$ and a function $ :V \rightarrow \{1,2,\dots,k\}$ and asks whether a planar drawing of $G$ exists such that each edge is monotone in the $y$-direction and, for any $u,v\in V$ with $ (u)
Patrizio Angelini +3 more
openaire +3 more sources
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3
We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra +2 more
core +1 more source
A lack of standard approaches for testing and reporting the performance of metal halide perovskites and organic semiconductor radiation detectors has resulted in inconsistent interpretation of performance parameters, impeding progress in the field. This Perspective recommends key metrics and experimental details, which are suggested for reporting in ...
Jessie A. Posar +8 more
wiley +1 more source
An Analogue of DP-Coloring for Variable Degeneracy and its Applications
A graph G is list vertex k-arborable if for every k-assignment L, one can choose f(v) ∈ L(v) for each vertex v so that vertices with the same color induce a forest. In [6], Borodin and Ivanova proved that every planar graph without 4-cycles adjacent to 3-
Sittitrai Pongpat, Nakprasit Kittikorn
doaj +1 more source
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source
Uniquely identifying the vertices of pendant-free tricyclic graphs
Planar interconnection networks are essential in VLSI circuit design because they provide efficient layouts that minimize wire use, reduce manufacturing costs, and prevent wire crossings.
Hariharan S, Mohana N
doaj +1 more source

