Cerca
Ara es mostren els items 1-10 de 10
Trees whose even-degree vertices induce a path are antimagic
(2019-05-16)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ...
Metric dimension of maximal outerplanar graphs
(2019-03-28)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
A new lower bound on the maximum number of plane graphs using production matrices
(2019-11-01)
Article.
Accés obert
Article.
Accés obert
We use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(42.11n ) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n ) by Aichholzer ...
Trees whose even-degree vertices induce a path are antimagic
(2022-08)
Article.
Accés obert
Article.
Accés obert
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ...
Convex quadrangulations of bichromatic point sets
(2020-06-05)
Article.
Accés obert
Article.
Accés obert
We consider quadrangulations of red and blue points in the plane where each face is convex and no edge connects two points of the same color. In particular, we show that the following problem is NP-hard: Given a finite set ...
New production matrices for geometric graphs
(Elsevier, 2022-01-15)
Article.
Accés obert
Article.
Accés obert
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and ...
Antimagic labelings of caterpillars
(2019-04-15)
Article.
Accés obert
Article.
Accés obert
A k-antimagic labeling of a graph G is an injection from E(G) to {1,2, ..., |E(G)|+k} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident ...
Caterpillars are antimagic
(2021-01-21)
Article.
Accés obert
Article.
Accés obert
An antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ...
Flips in higher order Delaunay triangulations
(2021)
Text en actes de congrés.
Accés restringit per política de l'editorial
Text en actes de congrés.
Accés restringit per política de l'editorial
We study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph ...
Colored anchored visibility representations in 2D and 3D space
(2020-08)
Article.
Accés obert
Article.
Accés obert
In a visibility representation of a graph G, the vertices are represented by nonoverlapping geometric objects, while the edges are represented as segments that only intersect the geometric objects associated with their ...