Gallian in 2007 gave the construction of the prism by considering the cartesian product of the cycle and the path . The generalized Petersen graph was introduced in 1950 by Coxeter. The generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. A graph G is said to be equitable -coloring if the vertex set is partitioned into disjoint independent sets so that the size of each partition differs at most one by the rest of the partitions. In this paper, we discussed the equitable coloring of the prisms and obtained the result that its chromatic number always lies between 2 and 3. We have also discussed the equitable coloring of the gener...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
In this BSc thesis we deal with chromatic index of cubic graphs, where we mainly focus on a signific...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
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...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
In this BSc thesis we deal with chromatic index of cubic graphs, where we mainly focus on a signific...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
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...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...