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

Jing-jing Tian, Fang'an Deng (2010)

> Home

Details and statistics

DOI: 10.1109/FSKD.2010.5569453

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fskd/TianD10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fskd/TianD10
Jing-jing Tian, Fang'an Deng:
One upper bound on the D(3)-vertex-distinguishing edge- chromatic numbers of graphs. FSKD 2010: 1905-1907

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.