Results 231 to 240 of about 28,550 (268)

Inverse Design of Metal-Organic Polyhedra through Molecular Fragmentation and Evolutionary Optimisation. [PDF]

J Chem Inf Model
Butler PWV, Rihm SD, Mosbach S, Akroyd J, Kraft M.   +4 more
europepmc   +1 more source

High-Precision Extrinsic Calibration for Multi-LiDAR Systems with Narrow FoV via Synergistic Planar and Circular Features. [PDF]

Sensors (Basel)
Sun X, Zhang Z, Xu S, Liu J.
europepmc   +1 more source

Local clustering decoder as a fast and adaptive hardware decoder for the surface code. [PDF]

Nat Commun
Ziad AB, Zalawadiya A, Topal C, Camps J, Gehér GP, Stafford MP, Turner ML.   +6 more
europepmc   +1 more source

Connectivity Labeling in Faulty Colored Graphs. [PDF]

Distrib Comput
Petruschka A, Sapir S, Tzalik E.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Light edges in 1‐planar graphs

Journal of Graph Theory, 2022
AbstractA graph is 1‐planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, we prove that every 1‐planar graph with minimum degree at least 3 contains an edge with such that one of the following holds: (1) and ; (2) and ; (3) and ; (4) and ; (5) .
Juan Liu, Yiqiao Wang 0002, Weifan Wang 0001   +2 more
openaire   +1 more source

Outer 1-Planar Graphs

Algorithmica, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber   +6 more
openaire   +2 more sources

On the Pagenumber of 1-Planar Graphs

Chinese Annals of Mathematics, Series B
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guan, Xiaxia, Yang, Weihua
openaire   +1 more source

The Maximal 1-Planarity and Crossing Numbers of Graphs

Graphs and Combinatorics, 2021
This paper deals with 1-planar graphs and their crossing number. A 1-planar graph is a graph that has a drawing on the plane where each edge has at most one crossing. Hence, a 1-planar graph is a superfamily of planar graphs. It is known, due to a result by \textit{J. Czap} and \textit{D. Hudák} [Electron. J. Comb. 20, No.
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong   +2 more
openaire   +2 more sources

Remarks on the joins of 1-planar graphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhangdong Ouyang, Jun Ge, Yichao Chen
openaire   +1 more source

The Vertex Arboricity of 1-Planar Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongdong Zhang, Juan Liu, Yongjie Li, Hehua Yang   +3 more
openaire   +2 more sources