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
Total coloring of circulant graphs Cn(1, 4)
Sign Up to like & getrecommendations! Published in 2025 at "Hacettepe Journal of Mathematics and Statistics"
DOI: 10.15672/hujms.1404223
Abstract: Total coloring of circulant graphs has attracted much attention in recent years. Studies on the total chromatic numbers of them, in particular 4- regular circulant graphs, have thrown up a number of interesting results. However,… read more here.
Keywords: coloring circulant; total coloring; graphs; total chromatic ... See more keywords