Results 61 to 70 of about 18,159 (263)
Drawing Outer 1-planar Graphs with Few Slopes
Journal of Graph Algorithms and Applications, 2015 A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees.
Emilio Di Giacomo +2 more
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
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
Posets and planar graphs [PDF]
Journal of Graph Theory, 2005 AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Intersection Graphs in Simultaneous Embedding with Fixed Edges
Journal of Graph Algorithms and Applications, 2009 We examine the problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a for (G1,G2).
Michael Jünger, Michael Schulz
doaj +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
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
Additive Manufacturing of Alumina‐Reinforced Elastomers
Advanced Engineering Materials, EarlyView.Vat‐photopolymerized elastomers reinforced with platelet‐shaped alumina exhibited preferential orientation, reduced porosity, and significantly enhanced mechanical performance. A 3 wt% platelet loading increased tensile strength from 12.4 to 45.7 MPa, highlighting the critical role of filler morphology in elastomeric VPP composites.
Majid Barzegar Keyvani +6 more
wiley +1 more source