Results 121 to 130 of about 1,442,532 (348)
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Previous studies on additive manufacturing primarily focus on the mechanical properties of as‐printed components. In the present work, researchers explore the potential of employing novel thermomechanical postprocessing techniques to improve the microstructure after printing.
Radim Kocich +3 more
wiley +1 more source
2-distance 4-coloring of planar subcubic graphs with girth at least 21 [PDF]
Discrete Mathematics & Theoretical Computer ScienceA $2$-distance $k$-coloring of a graph is a proper vertex $k$-coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance $4$-coloring for planar subcubic graphs with girth at least 21. We also show
Hoang La, Mickael Montassier
doaj +1 more source
Computational Geometry, 2009 AbstractWe review results concerning edge flips in planar graphs concentrating mainly on various aspects of the following problem: Given two different planar graphs of the same size, how many edge flips are necessary and sufficient to transform one graph into another?
Ferran Hurtado, Prosenjit Bose
openaire +2 more sources
Advanced Engineering Materials, EarlyView.In this research, ZrC coatings are evaluated against various counterprobes at the microscale using novel super‐stiff atomic force microscopy cantilevers. The chemical composition of the coating is shown to be an important factor influencing coating hardness and Young's modulus, while surface roughness, counterprobe hardness, and surface energy are the ...
Piotr Jenczyk +4 more
wiley +1 more source
On the Planarity of Generalized Line Graphs
Theory and Applications of Graphs, 2019 One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.This study reports for the first time the mechanical properties of brazed joints featuring Additively manufactured parts, such parts will likely need to be joined or combined with other components, and brazing offers a way of doing this for complex shapes without distortion. A new shear test methodology developed for such joints is also described.
Frances Livera +7 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.The functional properties of Fe–Mn–Si–Cr‐based shape memory alloys are influenced, among other things, by their chemical composition. Here, the vaporization of Mn, the most volatile element of the alloy, is investigated. It is shown that the process parameters make noninterchangeable contributions to the vaporization and that vaporization differences ...
Maylin Homfeldt, Anastasiya Toenjes
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 new experimental setup, incorporating digital image correlation and infrared thermography in combination with inductive‐conductive heating for precise temperature control, is used to analyze the mechanical behavior and microstructural changes of sheet metal under complex thermomechanical test conditions that represent quench and partitioning ...
Christian Illgen +4 more
wiley +1 more source