Exploració per tema "Configuracions i dissenys combinatoris"
Ara es mostren els items 1-5 de 5
-
A novel model for arc territory design: promoting Eulerian districts
(2015-01-01)
Article
Accés obertThe 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
(John Wiley and Sons, Inc., 1995)
Capítol de llibre
Accés restringit per política de l'editorialLet $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
(2014-01-31)
Article
Accés obert -
Linearly dependent vectorial decomposition of clutters
(2014)
Text en actes de congrés
Accés obertThis 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
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertA (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 ...