Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

2016 
A total coloring of a graph $$G$$G is a coloring of its vertices and edges such that adjacent or incident vertices and edges are not colored with the same color. A total $$[k]$$[k]-coloring of a gr...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []