Add to ORKGAn equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ in size by at most one. Equitable colorings naturally arise in some scheduling, partitioning
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices ...
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...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
AbstractA proper vertex coloring of a graph is equitable if the sizes of its color classes differ by...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices ...
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...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
AbstractA proper vertex coloring of a graph is equitable if the sizes of its color classes differ by...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices ...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...