<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this paper we obtain interesting results regarding the equitable chromatic number $\chi_{=}$ for the corona graph of a simple graph with a wheel graph $G\circ W_n$. Some extensions into $l$-corona products are also determined.</p
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
AbstractFor a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→{1...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
Let the vertices of a graph such that every two adjacent vertices have different color is a very com...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
AbstractFor a positive integer k, a graph G is equitably k-colorable if there is a mapping f:V(G)→{1...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
Cahit [4] proposed the concept of labeling the vertices and edges among the set of integers {0,1,2,…...