• A novel model for arc territory design: promoting Eulerian districts 

      Garcia Ayala, Gariela; González Velarde, José Luis; Rios Mercados, Roger; Fernández Aréizaga, Elena (2015-01-01)
      Article
      Accés obert
      The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be ...
    • c-Critical graphs with maximum degree three 

      Fiol Mora, Miquel Àngel (John Wiley and Sons, Inc., 1995)
      Capítol de llibre
      Accés restringit per política de l'editorial
      Let $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident ...
    • From clutters to matroids 

      Martí Farré, Jaume (2014-01-31)
      Article
      Accés obert
    • Linearly dependent vectorial decomposition of clutters 

      Martí Farré, Jaume (2014)
      Text en actes de congrés
      Accés obert
      This paper deals with the question of completing a monotone increas- ing family of subsets G of a finite set ¿ to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...
    • On the existence of combinatorial configurations 

      Bras Amorós, Maria; Stokes, Klara (Iniciativa Digital Politècnica, 2011)
      Text en actes de congrés
      Accés obert
      A (v, b, r, k) combinatorial configuration can be defined as a connected, (r, k)-biregular bipartite graph with v vertices on one side and b vertices on the other and with no cycle of length 4. Combinatorial configurations ...