Results 71 to 80 of about 975,712 (248)
An algorithm of graph planarity testing and cross minimization [PDF]
Computer Science Journal of Moldova, 2007 This paper presents an overview on one compartment from the graph theory, called graph planarity testing. It covers the fundamental concepts and important work in this area.
Vitalie Cotelea, Stela Pripa
doaj
On the Circumference of Essentially 4-connected Planar Graphs
Journal of Graph Algorithms and Applications, 2020 A planar graph is essentially $4$-connected if it is 3-connected and every of its 3-separators is the neighborhood of a single vertex. Jackson and Wormald proved that every essentially 4-connected planar graph $G$ on $n$ vertices contains a cycle of ...
Igor Fabrici +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig +2 more
wiley +1 more source
Planar Graph Classifier - Scripting
, 2022 All python scripts used in the Planar Graph Classifier ...
Hummel, Matthias
core +1 more source
Advanced Engineering Materials, EarlyView.Despite benefits to storage stability and handleability of aluminum scrap, octadecyl phosphonic acid (ODPA) SAMs reduce the tensile strength of wires produced using friction‐induced recycling. Etching and methyl diphosphonic acid (MDPA) coatings, however, have little effect.
Timothy D. Goller +3 more
wiley +1 more source
Computing in Geometry and TopologyWe study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick +4 more
doaj +1 more source
Geometric RAC Simultaneous Drawings of Graphs
Journal of Graph Algorithms and Applications, 2013 In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set, a geometric RAC simultaneous drawing is a straight-line drawing in which each graph is drawn planar, there are no edge ...
Evmorfia Argyriou +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.The present work reports the microstructural, mechanical, and texture evolution of a dissimilar combination laser‐welded maraging steel with 4340 steel. This is important for aerospace applications. The demand for dissimilar welding is growing rapidly with the requirement of efficient and durable joints.
Bharat Behl +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1998 Given four distinct vertices in a 4-connected planar graph \(G\), we characterize when the graph \(G\) contains a \(K_4\)-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no \(K_4\)-subdivision with specified degree three vertices, if ...
openaire +2 more sources
CoRR, 2018 We show that for any $k \geq 0$, there exists a planar graph which is $B_{k+1}$-CPG but not $B_k$-CPG. As a consequence, we obtain that $B_k$-CPG is a strict subclass of $B_{k+1}$-CPG.
Nicolas Champseix +2 more
openaire +3 more sources