• Recoloring directed graphs 

      Felsner, Stefan; Huemer, Clemens; Saumell Mendiola, Maria (Prensas Universitarias de Zaragoza, 2009)
      Text en actes de congrés
      Accés obert
      Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings and ' are joined by a ...