Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Garijo, Delia"'
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the combinato
Externí odkaz:
http://arxiv.org/abs/2305.03107
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to capture natur
Externí odkaz:
http://arxiv.org/abs/2201.12650
Publikováno v:
In European Journal of Combinatorics May 2024 118
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a natural measu
Externí odkaz:
http://arxiv.org/abs/2103.11676
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mo
Externí odkaz:
http://arxiv.org/abs/1807.10093
Given a set $S$ of $n$ line segments in the plane, we say that a region $\mathcal{R}\subseteq \mathbb{R}^2$ is a {\em stabber} for $S$ if $\mathcal{R}$ contains exactly one endpoint of each segment of $S$. In this paper we provide optimal or near-opt
Externí odkaz:
http://arxiv.org/abs/1703.04329
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cáceres, José, Garijo, Delia, González, Antonio, Márquez, Alberto, Puertas, María Luz, Ribeiro, Paula
We study the problem of augmenting the locus $\mathcal{N}_{\ell}$ of a plane Euclidean network $\mathcal{N}$ by inserting iteratively a finite set of segments, called \emph{shortcut set}, while reducing the diameter of the locus of the resulting netw
Externí odkaz:
http://arxiv.org/abs/1604.03878
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we r
Externí odkaz:
http://arxiv.org/abs/1603.06764
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent study on other
Externí odkaz:
http://arxiv.org/abs/1401.3686