Exploració per tema "Edge-coloring"

Ara es mostren els items 1-3 de 3

    • A Boolean algebra approach to the construction of snarks 

      Fiol Mora, Miquel Àngel (John Wiley & Sons, 1991)
      Capítol de llibre
      Accés obert
      This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored. A natural generalization of the concept of "color", that describes in a simple way the coloring ("0" or "1") of any set ...

    • 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 ...

    • Graphs, Friends and Acquaintances 

      Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel (2010-04-23)
      Report de recerca
      Accés obert
      As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs ...