Exploració per tema "Bipartite"

Ara es mostren els items 1-2 de 2

    • Bounds on the k-restricted arc connectivity of some bipartite tournaments 

      Balbuena Martínez, Maria Camino Teófila; González Moreno, Diego; Olsen, Mika (2018-08-15)
      Article
      Accés obert
      For k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such that contains at least k non-trivial strong components. The k-restricted arc connectivity of a digraph D was defined by ...

    • The Manhattan product of digraphs 

      Comellas Padró, Francesc de Paula; Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2007-10-03)
      Article
      Accés obert
      We give a formal definition of a new product of bipartite digraphs, the Manhattan product, and we study some of its main properties. It is shown that when all the factors of the above product are (directed) cycles, then ...