Results 41 to 50 of about 107,869,965 (249)

On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július   +2 more
doaj   +1 more source

Microvascular Damage Is Associated With Carotid Wall Structural Changes in Systemic Sclerosis: A Capillaroscopy and Ultrasound‐Based Observational Study

open access: yesArthritis Care &Research, EarlyView.
Objective Systemic sclerosis (SSc) is characterized by cardiovascular risk excess not fully explained by traditional factors. Whether the severity of microvascular damage correlates with structural subclinical atherosclerosis remains unclear. We investigated the relationship between nailfold videocapillaroscopy (NVC) abnormalities and carotid ...
Eugenio Capparelli   +13 more
wiley   +1 more source

Recognizing IC-Planar and NIC-Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2018
We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge.
Franz Brandenburg
doaj   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

Pathwidth of 2-Layer k-Planar Graphs

open access: yesComputing in Geometry and Topology
A bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj   +1 more source

Acyclic Chromatic Index of 1-Planar Graphs

open access: yesMathematics, 2022
The acyclic chromatic index χa′(G) of a graph G is the smallest k for which G is a proper edge colorable using k colors. A 1-planar graph is a graph that can be drawn in plane such that every edge is crossed by at most one other edge.
Wanshun Yang   +5 more
doaj   +1 more source

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

open access: yesAdvanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice   +2 more
wiley   +1 more source

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

open access: yesAdvanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora   +4 more
wiley   +1 more source

The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

open access: yesAKCE International Journal of Graphs and Combinatorics
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj   +1 more source

Flexural Behavior of 3D‐Printed Porous Bouligand‐Structured Polymers: Influence of Pitch Angle and Porosity

open access: yesAdvanced Engineering Materials, EarlyView.
This study examines how helicoidal architectures with different porosities respond to bending. Adjusting layer angle and spacing in 3D‐printed polymers reveals clear tradeoffs between stiffness, strength, and energy absorption. Experiments and simulations highlight designs that distribute stress effectively, offering pathways for optimizing lightweight
Praveenkumar Subhash Patil   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy