Results 91 to 100 of about 1,379,637 (289)
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by đ's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
Simple and Direct Proof of MacLane's Planarity Criterion [PDF]
arXiv, 2006 We give a simple proof of MacLane's algebraic planarity criterion for graphs. This proof does not use any other known planarity criteria. Keywords: graph, planarity, cycle space, a simple basis of a graph.
arxiv
Advanced Engineering Materials, EarlyView.A 3D shape memory polymerâbased hookâandâloop fastener, fabricated using projection microstereolithography and molding, offers tunable bonding strength through temperature control. When heated from 25 to 70â°C, the fastener softens and deforms easily, reducing bonding strength by 20âfold for onâdemand easy separation.
Chen Yang +5 more
wiley +1 more source
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
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
Involving d-Convex Simple and Quasi-simple Planar Graphs in R3 [PDF]
Computer Science Journal of Moldova, 2005 The problem of finding dimension of d-convex simple and quasi-simple planar graphs is studied. Algorithms for involving these graphs in R3 are described.
Nadejda Sur, Sergiu Cataranciuc
doaj
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
Drawing Planar Graphs with Many Collinear Vertices [PDF]
arXiv, 2016 Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity.
arxiv
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
A subexponential parameterized algorithm for Subset TSP on planar graphs
ACM-SIAM Symposium on Discrete Algorithms, 2014 Given a graph G and a subset S of vertices, the Subset TSP problem asks for a shortest closed walk in G visiting all vertices of S. The problem can be solved in time 2k ·nO(1) using the classical dynamic programming algorithms of Bellman and of Held and ...
P. Klein, D. Marx
semanticscholar +1 more source