Inproceedings,

One upper bound on the D(3)-vertex-distinguishing edge- chromatic numbers of graphs.

, and .
FSKD, page 1905-1907. IEEE, (2010)

Meta data

Tags

Users

  • @dblp

Comments and Reviews