Results 141 to 150 of about 18,582 (315)
Coloring count cones of planar graphs
For a plane near‐triangulation G with the outer face bounded by a cycle C, let nG⋆ denote the function that to each 4‐coloring ψ of C assigns the number of ways ψ extends to a 4‐coloring of G.
Lidicky, Bernard, Dvořák, Zdeněk
core
ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro +14 more
wiley +1 more source
Interval Incidence Coloring of Subcubic Graphs
In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj +1 more source
This study presents a reversible temperature sensor with high switching ratio, ∼103. The device is fabricated using PET‐ITO and carbon nanotube dispersions in alkane. Considering its application in cold chain logistics, a proof‐of‐concept with LED is showcased. Thus, a temperature drop below the threshold temperature (crystallization temperature of the
Sunil Kumar Behera +8 more
wiley +1 more source
Graph algorithm vertex coloring
Graph coloring problem is to find the minimal number of colors to color vertex of a graph in such a way that every two vertex linked by an edge have different colors. A vertex coloring algorithm has been presented.
Suyudi, M. +3 more
core
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
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 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 objective of the Graph Coloring problem is to color vertices of a graph in such a way that no two vertices that share an edge are assigned the same color.
Al-Ibrahim, Naser +3 more
core
This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat +7 more
wiley +1 more source
Inclusive Local Irregularity Vertex Coloring In Grid Graph Family
Let is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with .
Arika Indah Kristiana +5 more
doaj +1 more source

