2008•Journal of Shandong UniversityRequires access
On the adjacent vertex-distinguishing incidence coloring of general Mycielski graphs
Wei Zhou
Open publisher page 0 citations
Abstract
The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfying the sets with different colors of two adjacent vertices. The adjacent vertex-distinguishing incidence coloring of path,cycle with 3 m or 4 m vertices and the complete graph's general Mycielski graphs were studied.It exploits the area of the graph coloring for studying the structure of graphs.