Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!
BIAN Xi-yan, MIAO Lian-ying, SHANG Hua-hui DUAN Chun-yan, MA Guo-yi, . Adjacent vertex-distinguishing edge partition of graphs[J]. Journal of East China Normal University (Natural Sciences), 2009, (4): 16-20.
Citation:
BIAN Xi-yan, MIAO Lian-ying, SHANG Hua-hui DUAN Chun-yan, MA Guo-yi, . Adjacent vertex-distinguishing edge partition of graphs[J]. Journal of East China Normal University (Natural Sciences), 2009, (4): 16-20.
BIAN Xi-yan, MIAO Lian-ying, SHANG Hua-hui DUAN Chun-yan, MA Guo-yi, . Adjacent vertex-distinguishing edge partition of graphs[J]. Journal of East China Normal University (Natural Sciences), 2009, (4): 16-20.
Citation:
BIAN Xi-yan, MIAO Lian-ying, SHANG Hua-hui DUAN Chun-yan, MA Guo-yi, . Adjacent vertex-distinguishing edge partition of graphs[J]. Journal of East China Normal University (Natural Sciences), 2009, (4): 16-20.
he minimum number of colors required to give a graph $G$ an adjacent vertex-distinguishing edge partition was studied. Based on the classification of the degree of a graph, this paper proved that every graph without $K_{2}$ of minimum degree at least 188 permits an adjacent vertex-distinguishing 3-edge partition. The result is more superior than previous ones.