Add to ORKGThe equitable edge chromatic number is the minimum number of colors required to color the edges of graph G, for which G has a proper edge coloring and if the number of edges in any two color classes differ by at most one. In this paper, we obtain the equitable edge chromatic number of Sⴖ, Wn, Hn and Gn.Publisher's Versio
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractThe harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors...
We present two new integer programming formulations for the equitable coloring problem. We also prop...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
Given a multigraph G = (V,E) with n vertices andm edges and a color set C = {1, 2,..., k}, the nearl...
Abstract An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfie...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorith...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets ...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractThe harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors...
We present two new integer programming formulations for the equitable coloring problem. We also prop...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
Given a multigraph G = (V,E) with n vertices andm edges and a color set C = {1, 2,..., k}, the nearl...
Abstract An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfie...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorith...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets ...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractThe harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors...
We present two new integer programming formulations for the equitable coloring problem. We also prop...