Results 41 to 50 of about 29,089 (268)
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
On Computation of Degree-Based Entropy of Planar Octahedron Networks
Journal of Function Spaces, 2022 Chemical graph theory is the combination of mathematical graph theory and chemistry. To analyze the biocompatibility of the compounds, topological indices are used in the research of QSAR/QSPR studies.
Tian-Le Sun +5 more
doaj +1 more source
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
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.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Treewidth 2 in the Planar Graph Product Structure Theorem [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any
Marc Distel +4 more
doaj +1 more source
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 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
On random planar graphs, the number of planar graphs and their triangulations
Journal of Combinatorial Theory, Series B, 2003 This paper investigates random planar graphs---the number of planar graphs and their triangulations. A random planar graph \(P_n\) is selected uniformly from \(\alpha_n\) where \(\alpha_n\) is the set of labelled planar graphs with \(\{1,2,3,\dots, n\}\) as vertex set. The following are the main results: (1) \(|\alpha_n|\leq n!(37.3)^{n+o(n)}\).
Deryk Osthus +2 more
openaire +1 more source