Neighbor sum distinguishing total coloring of 2-degenerate graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0053-5
Abstract: A proper k-total coloring of a graph G is a mapping from $$V(G)\cup E(G)$$V(G)∪E(G) to $$\{1,2,\ldots ,k\}$${1,2,…,k} such that no two adjacent or incident elements in $$V(G)\cup E(G)$$V(G)∪E(G) receive the same color. Let f(v) denote… read more here.
Keywords: total coloring; sigma delta; sum distinguishing; distinguishing total ... See more keywords
Total coloring of planar graphs without adjacent chordal 6-cycles
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0063-3
Abstract: A total coloring of a graph G is a coloring such that no two adjacent or incident elements receive the same color. In this field there is a famous conjecture, named Total Coloring Conjecture, saying… read more here.
Keywords: total coloring; planar; without adjacent; chordal cycles ... See more keywords