Open Access
MATEC Web of Conferences
Volume 31, 2015
2015 7th International Conference on Mechanical and Electronics Engineering (ICMEE 2015)
Article Number 17006
Number of page(s) 3
Section Computer network and communication system
Published online 23 November 2015
  1. W. K. Hale: Frequency assignment: theory and applications, Proc IEEE 68(1980), p.1497–1514. [CrossRef]
  2. J. R. Griggs and R. K. Yeh: Labelling graphs with a condition at distance 2, SIAM J Discrete Math 5(1992), p.586–595. [CrossRef]
  3. G. J. Chang and D. Kuo: The labelling problem on graphs, SIAM J Discrete Math 9(1996), p. 309–316. [CrossRef]
  4. G. J. Chang, W.-T. Ke, D. Kuo, Daphne D.-F. Liu, and R. K. Yeh: On labelling of graphs, Discrete Math 220(2000), p. 57–66. [CrossRef]
  5. J. P. Georges, D. W. Mauro, and M. I. Stein: Labeling products of complete graphs with a condition at distance two, SIAM J Discrete Math 14(2000), p. 28–35. [CrossRef]
  6. D. Kr′al and R. Škrekovski: A theorem about the channel assignment problem, SIAM J Discrete Math 16(2003), p.426–437. [CrossRef]
  7. M. Molloy and M. R. Salavatipour: A bound on the chromatic number of the square of a planar graph, J Combin Theory Ser B 94(2005), p.189–213. [CrossRef]
  8. D. Sakai: Labelling chordal graphs: distance two condition, SIAM J Discrete Math 7(1994), p.133–140. [CrossRef]
  9. F. Bazzaroa, M. Montassier, and A. Raspaud: total labelling of planar graphs with large girth and high maximum degree, Discrete Math, in press.
  10. D. Chen and W. Wang, total labelling of outerplanar graphs, submitted.
  11. Haina Sun, Trees with 3,4 are not in maximum degree distance, Lecture Notes in Information Technology, 3(2011),p. 91–95