The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\Delta =10$$Δ=10
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-9995-x
Abstract: A (proper) total-k-coloring of a graph G is a mapping $$\phi : V (G) \cup E(G)\mapsto \{1, 2, \ldots , k\}$$ϕ:V(G)∪E(G)↦{1,2,…,k} such that any two adjacent elements in $$V (G) \cup E(G)$$V(G)∪E(G) receive different colors.… read more here.
Keywords: vertex distinguishing; distinguishing total; adjacent vertex; delta ... See more keywords