Ma-Lian Chia

  • Citations Per Year
Learn More
Let G be a graph and let k be a positive integer. Consider the following two-person game which is played on G: Alice and Bob alternate turns. A move consists of selecting an unlabeled vertex v of G and assigning it a number a from {0, 1, 2, . . . , k} satisfying the condition that, for all u ∈ V (G), u is labeled by the number b previously, if d(u, v) = 1,(More)
  • 1