Paired and semipaired domination in near-triangulations

Autor: Hernando Martín, María del Carmen, Claverol Aguas, Mercè, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel Altarriba, Francisco Javier

A dominating set of a graph G is a subset D of vertices such that every vertex not in D is adjacent to at least one vertex in D. A dominating set D is paired if the subgraph induced by its vertices has a perfect matching, and semipaired if every vert

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::3594e60dccc99b15fb18d477f9f9c81b
https://hdl.handle.net/2117/374877

K-1,K-3-covering red and blue points in the plane

Autor: Ábrego, Bernardo M., Fernández Merchant, Silvia, Kano, Mikio, Orden, David, Pérez Lantero, Pablo, Seara Ojea, Carlos, Tejel Altarriba, Francisco Javier

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

We say that a finite set of red and blue points in the plane in general position can be K1,3-covered if the set can be partitioned into subsets of size 4, with 3 points of one color and 1 point of the other color, in such a way that, if at each subse

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4231480c2272dc472026a99cdb3d2356
http://hdl.handle.net/2117/176195

On dynamic programming with underlying Monge path-decomposable array

Autor: García Olaverri, Alfredo, Jodrá Esteban, Pedro, Tejel Altarriba, Francisco Javier

Publikováno v: idUS. Depósito de Investigación de la Universidad de Sevilla
instname

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c5aa9404bbc66478b13e9c39fa45b4d6