# Search results for: Géza Toth

*MEN1*gene. Phenotype varies widely, and no definitive correlation with the genotype has been observed. Mutation-negative patients with MEN1-associated tumors represent phenocopies. By comparing mutation-positive and mutation-negative patients, we aimed to identify phenotype features predictive for...

EPJ Data Science > 2018 > 7 > 1 > 1-13

Journal of Graph Theory > 88 > 1 > 101 - 109

Computational Geometry > 2018 > 68 > C > 2-6

Sensors and Actuators B: Chemical > 2017 > 252 > C > 983-990

Neuroscience Letters > 2017 > 643 > C > 16-21

Journal of Food Engineering > 2017 > 193 > C > 20-28

LWT - Food Science and Technology > 2017 > 75 > C > 305-315

Journal of Combinatorial Theory, Series A > 2016 > 144 > C > 292-305

Neuropeptides > 2016 > 57 > C > 15-20

Journal of Informetrics > 2016 > 10 > 2 > 516-532

*G*be a graph without loops or multiple edges drawn in the plane. It is shown that, for any

*k*, if

*G*has at least

*C*

_{ k }

*n*edges and

*n*vertices, then it contains three sets of

*k*edges, such that every edge in any of the sets crosses all edges in the other two sets. Furthermore, two of the three sets can be chosen such that all

*k*edges in the set have a common...

Lecture Notes in Computer Science > Graph Drawing > 345-354

*v*vertices can be drawn in the plane so that every edge crosses at most

*k*> 0 others, then its number of edges cannot exceed 4.108√kv. For

*k*≤ 4, we establish a better bound, (

*k*+ 3)(

*u*− 2), which is tight for

*k*=1 and 2. We apply these estimates to improve a result of Ajtai et al. and Leighton, providing a general lower bound for the crossing number of a graph in terms of...

*k*> 1, there exist

*k*-fold coverings of the plane (1) with strips, (2) with axis-parallel rectangles, and (3) with homothets of any fixed concave quadrilateral, that cannot be decomposed into two coverings. We also construct, for every

*k*> 1, a set of points

*P*and a family of disks in the plane, each containing at least

*k*elements of

*P*, such that no matter how...

Lecture Notes in Computer Science > Graph Drawing > Papers > 50-60

*G*with maximum degree

*three*and with at least one vertex of degree smaller than

*three*has a straight-line drawing in the plane satisfying the following conditions. No three vertices are collinear, and a pair of vertices form an edge in

*G*if and only if the segment connecting them is parallel to one of the sides of a previously fixed regular pentagon. It is...

Lecture Notes in Computer Science > Graph Drawing > Papers > 3-14

*n*≥ 4 be even. It is shown that every set

*S*of

*n*points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of

*n*straight line edges such that the angle between any two consecutive edges is at most 2

*π*/3. For

*n*= 4 and 6, this statement is tight. It is also shown that every even-element point set

*S*can be partitioned into at most two subsets,...

Lecture Notes in Computer Science > Graph Drawing > Theory II > 328-337

*topological graph*is a graph drawn in the plane so that its vertices are represented by points, and its edges are represented by Jordan curves connecting the corresponding points, with the property that any two curves have at most one point in common. We define two canonical classes of topological complete graphs, and prove that every topological complete graph with

*n*vertices has a canonical subgraph...

*G*be a graph drawn in the plane so that its edges are represen tedbk;-monotone curv es, any p air of w hich cross anenvumber of times. We show that

*G*can be redrawn in such a w ay Hat the cordinates of the vertices remain une hanged and the edges become non-crossing straigh t-linesegments.

Lecture Notes in Computer Science > Graph Drawing > Papers > 114-125

*G*with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if

*G*is connected and has at least one vertex of degree less than three, then four directions suffice.