|
Descripción
|
|
|---|---|
| The concepts of monitoring the elements of triangulation graphs by edges and faces at a distance k (remote monitoring by edges and faces, respectively) were defi?ned by Hern?andez and Martins, Electronic Notes in Discrete Mathematics,(46) (2014), 145{152 [2]. Furthermore, for any n-vertex maximal outerplane graph, they provide combinatorial bounds when k = 2. In this paper we continue their study, generalizing its results to any value of k ? 2. | |
|
Internacional
|
Si |
|
Nombre congreso
|
XVI Spanish Meeting on Computacional Geometry, EGC2015 |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Barcelona |
|
Revisores
|
Si |
|
ISBN o ISSN
|
2014-2323 |
|
DOI
|
|
|
Fecha inicio congreso
|
01/07/2015 |
|
Fecha fin congreso
|
03/07/2015 |
|
Desde la página
|
103 |
|
Hasta la página
|
106 |
|
Título de las actas
|
Proceedings of the XVI Spanish Meeting on Computacional Geometry |