z-logo
open-access-imgOpen Access
Strong Vertex-distinguishing Total Coloring Algorithm for Complete Graphs based on Equitable Coloring
Author(s) -
Zhao Huanping,
Desheng Xue,
Shi Huojie
Publication year - 2020
Publication title -
journal of engineering science and technology review
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.19
H-Index - 28
eISSN - 1791-9320
pISSN - 1791-2377
DOI - 10.25103/jestr.131.17
Subject(s) - complete coloring , greedy coloring , fractional coloring , graph coloring , list coloring , total coloring , brooks' theorem , combinatorics , vertex (graph theory) , computer science , edge coloring , mathematics , algorithm , graph , chordal graph , 1 planar graph , graph power , line graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here