Sign Up to like & get
recommendations!
1
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
Sign Up to like & get
recommendations!
1
Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00860-3
Abstract: The adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that the edge coloring set on any pair of adjacent vertices is distinct. The minimum number of…
read more here.
Keywords:
vertex distinguishing;
adjacent vertex;
edge;
edge coloring ... See more keywords