Add to ORKGThe equitable total chromatic number is the smallest integer k for which the graph G has a proper coloring of vertices and edges, such that the number of elements in any two color classes differs by atmost one. In this paper, we have obtained the equitable total chromatic number of Mycielskian of Pn, Cn and Wn
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this pape...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe total chromatic number χt(G) of a graph G is the least number of colors needed to color ...
<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this pape...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...