Results 81 to 90 of about 38,199 (317)

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

open access: yesAdvanced Engineering Materials, EarlyView.
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič   +7 more
wiley   +1 more source

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

open access: yesMathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source

Computing The Irregularity Strength of Planar Graphs

open access: yesMathematics, 2018
The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang   +4 more
doaj   +1 more source

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

open access: yesAdvanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari   +5 more
wiley   +1 more source

Random planar graphs

open access: yesJournal of Combinatorial Theory, Series B, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire   +4 more sources

Height-Preserving Transformations of Planar Graph Drawings

open access: yes, 2014
There are numerous styles of planar graph drawings, such as straight-line drawings, poly-line drawings, orthogonal graph drawings and visibility representations. Given a planar drawing in one of these styles, can it be converted it to another style while
Biedl, Therese, Therese Biedl
core   +1 more source

An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials

open access: yesAdvanced Engineering Materials, EarlyView.
An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut   +16 more
wiley   +1 more source

Influence of Surface Finish on the Tribological Performance of AlTiBN Coatings Deposited on Forming Tools

open access: yesAdvanced Engineering Materials, EarlyView.
Aluminum and nitride coatings are used in industry because they are hard, resist wear, and protect against oxidation. Adding boron can improve friction behavior and other properties. This study tests coatings on surfaces with different finishes. Results show smoother surfaces perform better, while rough ones wear faster, although coatings can reduce ...
Adrián Claver   +9 more
wiley   +1 more source

Degeneracies of Triangulated Graphs

open access: yesTheory and Applications of Graphs
A graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj   +1 more source

Graph Drawing Techniques for Geographic Visualization [PDF]

open access: yes, 2004
Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph.
Rodgers, Peter
core  

Home - About - Disclaimer - Privacy