Now showing items 13-24 of 334

  • Characterizing path-like trees from linear configurations 

    López Masip, Susana Clara (2017)
    Conference lecture
    Open Access
    Assume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, ...
  • On subsets of the normal rational curve 

    Ball, Simeon Michael; De Beule, Jan (2017-06-01)
    Article
    Open Access
    A normal rational curve of the (k-1) -dimensional projective space over Fq is an arc of size q+1 , since any k points of the curve span the whole space. In this paper, we will prove that if q is odd, then a subset of size ...
  • Rainbow spanning subgraphs in bounded edge–colourings of graphs with large minimum degree 

    Cano Vila, María del Pilar; Perarnau Llobet, Guillem; Serra Albó, Oriol (2017-08-01)
    Article
    Open Access
    We study the existence of rainbow perfect matching and rainbow Hamiltonian cycles in edge–colored graphs where every color appears a bounded number of times. We derive asymptotically tight bounds on the minimum degree of ...
  • On sets defining few ordinary planes 

    Ball, Simeon Michael (2017-09-19)
    Article
    Open Access
    Let S be a set of n points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of S is less than (Formula presented.) for some ...
  • Locating domination in bipartite graphs and their complements 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    External research report
    Open Access
    A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...
  • Metric-locating-dominating partitions in graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
    External research report
    Open Access
    A partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other ...
  • Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
    External research report
    Open Access
    Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ...
  • A generalisation of Sylvester's problem to higher dimensions 

    Ball, Simeon Michael; Monserrat, Joaquim (2017-07-01)
    Article
    Open Access
    In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ points of $S$ span a hyperplane and not all the points of $S$ are contained in a hyperplane. The aim of this article is to ...
  • A finite version of the Kakeya problem 

    Ball, Simeon Michael; Blokhuis, Aart; Domenzain, Diego (2016-06-02)
    Article
    Open Access
    Let L be a set of lines of an affine space over a field and let S be a set of points with the property that every line of L is incident with at least N points of S. Let D be the set of directions of the lines of L considered ...
  • Characterizing identifying codes through the spectrum of a graph or digraph 

    Balbuena Martínez, Maria Camino Teófila; Dalfó Simó, Cristina; Martínez Barona, Berenice (2017)
    Conference report
    Open Access
  • Coloración de grafos por vecindades diferentes. 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcom, Liliana; Gutierrez, Marisa (2017-07-07)
    Part of book or chapter of book
    Restricted access - publisher's policy
    En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...
  • Limited broadcast domination: upper bounds and complexity 

    Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
    Part of book or chapter of book
    Restricted access - publisher's policy
    En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas ...