Buscar
Mostrando ítems 21-30 de 65
Artículo
Cover Contact Graphs
(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). ...
Artículo
A new 2D tessellation for angle problems: The polar diagram
(2006)
The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but the Euclidean minimum distance criterion is replaced for the minimal angle criterion. The result is ...
Artículo
On the metric dimension, the upper dimension and the resolving number of graphs
(2013)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang asking for a characterization of the graphs ...
Artículo
Artículo
The resolving number of a graph
(2013)
We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: ...
Artículo
Artículo
A linear algorithm to recognize maximal generalized outerplanar graphs
(Institute of Mathematics of the Czech Academy of Sciences, 1997)
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.
Artículo
Artículo
The determining number of Kneser graphs
(2013)
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies ...
Artículo
A link between menger’s theorem and infinite euler graphs
(Akadémiai Kiadó, 1997)