• 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 ...
  • 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 ...
  • The Maximum degree of series-parallel graphs 

    Drmota, Michael; Giménez Llach, Omer; Noy Serrano, Marcos (2011-07)
    Article
    Accés restringit per acord de confidencialitat
    We prove that the maximum degree Δn of a random series-parallel graph with n vertices satisfies Δn/ log n → c in probability, and EΔn ∼ c log n for a computable constant c > 0. The same kind of result holds for 2-connected ...