Results 81 to 90 of about 27,053 (309)
Journal of Computational Geometry, 2022 Morphing geometric graphs is a classical problem in graph theory and computational geometry with seminal results established by Cairns in 1944 [Amer. Math. Monthly, 51] and by Thomassen in 1983 [J. of Comb. Theor., Series B, 34].
Patrizio Angelini +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee +7 more
wiley +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
Кібернетика та комп'ютерні технології, 2020 The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Advanced 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
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N +3 more
core +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials
Advanced 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
Note on improper coloring of $1$-planar graphs [PDF]
, 2019 summary:A graph $G=(V,E)$ is called improperly $(d_1, \dots , d_k)$-colorable if the vertex set $V$ can be partitioned into subsets $V_1, \dots , V_k$ such that the graph $G[V_i]$ induced by the vertices of $V_i$ has maximum degree at most $d_i$ for all $
Yue, Jun, Sun, Lei, Chu, Yanan
core +1 more source
Journal 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
Advanced 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