journal6 ›› 2012, Vol. 33 ›› Issue (5): 12-15.DOI: 10.3969/j.issn.1007-2985.2012.05.003

• Mathematics • Previous Articles     Next Articles

Strong Edge Coloring of the Subdivision Graph of Lattices Graphs


  1. (Nanjing College of Chemical Technology,Nanjing 210048,China)
  • Online:2012-09-25 Published:2012-11-30

Abstract: The strong edge coloring of the subdivision graph of three kinds of lattices graphs is discussed.The subdivision graph of one lattice graph is achieved by replacing every edge of the lattice graph with one route which has a distance of two.This paper introduces one method of coloring for the subdivision graph of hexagonal lattice graph,quadrangular lattice graph and trigngular net graph,and then proves that Sχ′(Γs6)=4,Sχ′(Γs4)=5,Sχ′(Γs3)=7.

Key words: coloring, strong edge coloring, strong edge chromatic number, lattice graph, subdivision graph

WeChat e-book chaoxing Mobile QQ