Results 51 to 60 of about 30,007,210 (289)

On the Density of Maximal 1-Planar Graphs [PDF]

, 2013
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar graphs have at most 4n−8 edges. We show that there are sparse maximal 1-planar graphs with only $\frac{45}{17} n + \mathcal{O}(1)$ edges.
Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber   +5 more
openaire   +1 more source

On total colorings of 1-planar graphs [PDF]

Journal of Combinatorial Optimization, 2013
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Xin Zhang 0017, Jianfeng Hou, Guizhen Liu   +2 more
openaire   +3 more sources

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, Sang‐Hyeok Lee, Christina Gasper, Martina Freund, Sandra Korte‐Kerzel, Ulrich Kerzel   +5 more
wiley   +1 more source

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

, 2023
Upward planarity testing and Rectilinear planarity testing are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth.
Jansen, Bart M. P., Khazaliya, Liana; orcid:, Simonov, Kirill, Kindermann, Philipp, Montecchiani, Fabrizio, Liotta, Giuseppe; orcid:   +5 more
core   +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

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

Crystal structures of N′-aminopyridine-2-carboximidamide and N′-{[1-(pyridin-2-yl)ethylidene]amino}pyridine-2-carboximidamide

Acta Crystallographica Section E: Crystallographic Communications, 2017
The crystal structures of N′-aminopyridine-2-carboximidamide (C6H8N4), 1, and N′-{[1-(pyridin-2-yl)ethylidene]amino}pyridine-2-carboximidamide (C13H13N5), 2, are described. The non-H atoms in compound 1 are nearly planar (r.m.s. deviation from planarity =
Francois Eya'ane Meva, Timothy John Prior, David John Evans, Emmanuel Roland Mang   +3 more
doaj   +1 more source

Microstructure Reconstruction in Battery Electrodes Using Machine Learning Based on Low‐Voltage Focused Ion Beam–Scanning Electron Microscopy Tomography Images

Advanced Engineering Materials, EarlyView.
Low‐voltage FIB‐SEM tomography combined with a image preprocessing pipeline improves phase contrast and enables reliable machine‐learning segmentation of conductive networks in lithium‐ion battery electrodes. Structural descriptors are extracted from segmented images, done semimanually and automated, and compared.
Lisa Beran, Vincent Nebel, Dominik Perius, Kshitij Kumar, Yannis Heim, Laura Bies, Tobias Kraus   +6 more
wiley   +1 more source

Structural Parameterizations of $k$-Planarity

Journal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada   +2 more
doaj   +1 more source

4-Hydroxy-6-methyl-3-[3-(thiophen-2-yl)acryloyl]-2H-pyran-2-one

Acta Crystallographica Section E, 2013
The title compound, C13H10O4S, crystallizes with two molecules in the asymmetric unit in which the rings make dihedral angles of 3.9 (1) and 6.0 (1)°; this planarity is due in part to the presence of an intramolecular O—H...O ...
Salima Thabti, Amel Djedouani, Abderrahmen Bendaas, Sihem Boufas, Rémi Loui, Dominique Mandon   +5 more
doaj   +1 more source