The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
AbstractLet G=(V,E) be a graph and f:(V∪E)→[k] be a proper total k-coloring of G. We say that f is a...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
The adjacent vertex-distinguishing total chromatic number of a graph G, denoted by Eat(G), is the sm...
Analyzing chromatic number in coloring problem is a tough topic in graph analysis. We focus on the b...
Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent ve...
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1,...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
AbstractLet G=(V,E) be a graph and f:(V∪E)→[k] be a proper total k-coloring of G. We say that f is a...
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so...
The adjacent vertex-distinguishing total chromatic number of a graph G, denoted by Eat(G), is the sm...
Analyzing chromatic number in coloring problem is a tough topic in graph analysis. We focus on the b...
Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent ve...
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1,...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
AbstractA labeling of a graph G is distinguishing if it is only preserved by the trivial automorphis...
A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ pre...
DOI
Add to ORKG