Every grid has an independent [1, 2]-set |
|
ON THE BOUNDARY AS AN x-GEODOMINATING SET IN GRAPHS |
|
Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs |
|
Shortcut sets for the locus of plane Euclidean networks |
|
On independent [1, 2]-sets in trees 1 |
|
General bounds on limited broadcast domination |
|
On perfect and quasiperfect dominations in graphs |
|
Perfect and quasiperfect domination in trees |
|
Independent [1, 2]-domination of grids via min-plus algebra |
|
Shortcut sets for plane Euclidean networks (Extended abstract) |
|
Quasiperfect Domination in Trees |
|
The graph distance game and some graph operations |
|
Locating-dominating codes: Bounds and extremal cardinalities |
|
The determining number of Kneser graphs |
|
Resolving sets for Johnson and Kneser graphs |
|
Graph operations and Lie algebras |
|
On the metric dimension of infinite graphs |
|
MINIMAL TREES AND MONOPHONIC CONVEXITY |
|
Towards a new framework for domination |
|
On the determining number and the metric dimension of graphs |
|
On the geodetic and the hull numbers in strong product graphs |
|
On the Metric Dimension of Infinite Graphs |
|
On 3-Steiner simplicial orderings |
|
Steiner distance and convexity in graphs |
|
Geodeticity of the contour of chordal graphs |
|
Dilation-free graphs in the I1 metric |
|
On the metric dimension of cartesian products of graphs |
|
On geodetic sets formed by boundary vertices |
|
Rebuilding convex sets in graphs |
|
On the metric dimension of some families of graphs |
|
Resultados recientes sobre mosaicos de Penrose |
|
An aperiodic tiles machine |
|
Una máquina generadora de losetas aperiódicas |
|