Results 101 to 110 of about 147,831 (333)

Triangle Decompositions of Planar Graphs

Discussiones Mathematicae Graph Theory, 2016
A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e of G, the sum
Mynhardt Christina M., Bommel Christopher M. van   +1 more
doaj   +1 more source

A Potts/Ising Correspondence on Thin Graphs

, 1998
We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin'' random graphs in contrast to the fat graphs of the planar diagram
Ambjørn J, Bachas C, Baillie C, Baillie C, Banks T, Banks T, Baxter R, Baxter R, Baxter R, Baxter R, Boulatov D V, Brezin E, Brezin E, Brezin E, Callan C, Coleman S, D A Johnston, Essam J, Johnston D, Johnston D, Johnston D, Kazakov V, Kazakov V, Lipatov N, Lipatov N, Lipatov N, Lipatov N, Mehta M L, Parisi G, Peruggi F, Peruggi F, Peruggi F, Peruggi F, Whittle P, Whittle P, Whittle P   +35 more
core   +2 more sources

New Developments in the Field of Production and Application of Multi‐Material Wire Arc Additive Manufacturing Components: A Review

Advanced Engineering Materials, EarlyView.
The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley   +1 more source

Bar 1-Visibility Drawings of 1-Planar Graphs

, 2013
A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean, E.N. Argyriou, G. Battista Di, H. Dehkordi, I. Fabrici, J. Pach, K. Arikushi, P. Eades, P. Selvaraju, R. Tamassia, V.P. Korzhik, W. Didimo, W. Didimo, Y. Suzuki   +13 more
core   +1 more source

A Simulative Evaluation of Triply Periodic Minimal Surface Structures in the Context of Elastocaloric Applications

Advanced Engineering Materials, EarlyView.
A simulative evaluation of triply periodic minimal surface (TPMS) structures for an elastocaloric application under compressive load is performed. For the evaluation of the structure's performance, surface/volume ratio, generated heat and invested mechanical work are taken into account and are compared to a tube as a reference specimen.
Michael Fries, Paul Motzki, Dirk Bähre, Anne Jung   +3 more
wiley   +1 more source

Planar 4-critical graphs with four triangles

, 2013
By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such graphs.
Borodin, Oleg V., Dvořák, Zdeněk, Kostochka, Alexandr V., Lidický, Bernard, Yancey, Matthew   +4 more
core   +1 more source

Micromechanical Characterization of 316L‐V4E Steel Transitions Produced by Electron Beam Powder Bed Fusion with Dual‐Hopper Alternating Layer Strategy

Advanced Engineering Materials, EarlyView.
This work applies High‐Speed Nanoindentation to study multi‐material transitions in powder bed fusion–electron beam melting components. The aim is to assess the mechanical gradients and interfacial behavior between American iron and steel institute 316L stainless steel and V4E tool steel in additively manufactured structures.
Laia Ortiz‐Membrado, William Sjöström, Francesc Barberà Flichi, Carlos Botero, Anton S. Tremsin, Antonio Mateo, Emilio Jiménez‐Piqué   +6 more
wiley   +1 more source

Orienting planar graphs

Discrete Mathematics, 1976
AbstractIt is shown that every maximal planar graph (triangulation) can be contracted at an arbitrary point (by identifying it with an adjacent point) so that triangularity is preserved. This is used as a lemma to prove that every triangulation can be (a) oriented so that with three exceptions every point has indegree three, the exceptions having ...
openaire   +3 more sources

Optimizing Laser Ablation of Stainless Steels for Volume Removal and Surface Quality Using Burst of Pulses

Advanced Engineering Materials, EarlyView.
This study explores the ablation efficiency and surface quality of laser‐treated stainless steel alloys (AISI 304, AISI 420, and AISI 316Ti) using an ultrashort pulsed laser and varying burst parameters (MHz, GHz, and Bi‐burst). Both ablation rates and surface quality parameters are determined, including isotropy surface roughness values, highlighting ...
Dirk Obergfell, Bahman Azarhoushang, Andrés Fabián Lasagni   +2 more
wiley   +1 more source

Random planar maps and graphs with minimum degree two and three [PDF]

, 2018
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes.
Noy, Marc, Ramos, Lander
core   +2 more sources