Results 41 to 50 of about 294 (70)

No finite $5$-regular matchstick graph exists [PDF]

, 2014
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart.
Kurz, Sascha
core  

Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]

Discrete Comput Geom, 2023
Casel K, Fernau H, Grigoriev A, Schmid ML, Whitesides S.   +4 more
europepmc   +1 more source

The rectilinear local crossing number of $K_n$

, 2017
We determine ${\bar{\rm{lcr}}}(K_n)$, the rectilinear local crossing number of the complete graph $K_n$ for every $n$. More precisely, for every $n \notin \{8, 14 \}, $ \[ {\bar{\rm{lcr}}}(K_n)=\left\lceil \frac{1}{2} \left( n-3-\left\lceil \frac{n-3}{3}
Fernández-Merchant, Silvia, Ábrego, Bernardo M.   +1 more
core  

Best match graphs and reconciliation of gene trees with species trees. [PDF]

J Math Biol, 2020
Geiß M, Laffitte MEG, Sánchez AL, Valdivia DI, Hellmuth M, Rosales MH, Stadler PF.   +6 more
europepmc   +1 more source

Minimum triplet covers of binary phylogenetic X-trees. [PDF]

J Math Biol, 2017
Huber KT, Moulton V, Steel M.
europepmc   +1 more source

RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]

Multiscale Model Simul, 2018
Heroy S, Taylor D, Shi FB, Forest MG, Mucha PJ.   +4 more
europepmc   +1 more source

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. [PDF]

Discrete Comput Geom, 2017
Godsil C, Roberson DE, Rooney B, Šámal R, Varvitsiotis A.   +4 more
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

Discrete Comput Geom
Aichholzer O, García A, Tejel J, Vogtenhuber B, Weinberger A.   +4 more
europepmc   +1 more source

Crossover operators for molecular graphs with an application to virtual drug screening. [PDF]

J Cheminform
Domschke N, Schmidt BJ, Gatter T, Golnik R, Eisenhuth P, Liessmann F, Meiler J, Stadler PF.   +7 more
europepmc   +1 more source

Improved bounds for the crossing numbers of Km,n and Kn. [PDF]

Klerk, E. de, Maharry, J., Pasechnik, D.V., Richter, B., Salazar, G.   +4 more
core   +1 more source