Results 71 to 80 of about 29,342 (268)

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

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

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, Abril Azocar Guzman, Sarath Menon, Stefan Sandfeld, Tilmann Hickel, Markus Stricker   +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, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

Beyond Outerplanarity

Computing in Geometry and Topology
We 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, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff   +4 more
doaj   +1 more source

Subdivisions in Planar Graphs

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

Random planar graphs

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, Zongwen Fu, Robert Göstl, Hamed Shokri, Carmine Putignano, Gianluca Percoco, Bilal Gökce   +6 more
wiley   +1 more source

On the Effect of Creep on Local Lattice Orientation in Single‐Crystal Ni‐Based Superalloy Microstructures

Advanced Engineering Materials, EarlyView.
During creep of a single‐crystal Ni‐based superalloy, the overall crystal orientation is observed to remain constant while the microstructure evolves. Despite the lack of macroscopic rotation, small (<1°) rotations are observed on the submicron size scale and are accommodated by counteracting rotations over the scale of several micrometers.
E. J. Payton, E. B. Dursun, G. Eggeler, L. Agudo Jácome   +3 more
wiley   +1 more source

Algorithm and Experiments in Testing Planar Graphs for Isomorphism

Journal of Graph Algorithms and Applications, 2004
We give an algorithm for isomorphism testing of planar graphs suitable for practical implementation. The algorithm is based on the decomposition of a graph into biconnected components and further into SPQR-trees.
Jacek Kukluk, Lawrence Holder, Diane Cook   +2 more
doaj   +1 more source

Clique Planar Graphs

Electronic Notes in Discrete Mathematics, 2001
Abstract Abstract We generalize the idea of extended triangles of a graph G by considering a family of completes of G instead of the clique family of G. We characterize Helly and 3 - Helly Planar Graphs using extended triangles. We prove that if a planar graph is a clique graph then any one of its extended triangles is a clique graph.
Liliana Alcón, Marisa Gutierrez
openaire   +1 more source