DOIAbstract
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
International audienceA graph G = (V, E) is r-equitably k-colorable if there exists a partition of V...
AbstractA graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
We show that almost all trees can be equitably 3-colored, that is, with three color classes of cardi...
AbstractWe show that almost all trees can be equitably 3-colored, that is, with three color classes ...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
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...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
International audienceA graph G = (V, E) is r-equitably k-colorable if there exists a partition of V...
AbstractA graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
We show that almost all trees can be equitably 3-colored, that is, with three color classes of cardi...
AbstractWe show that almost all trees can be equitably 3-colored, that is, with three color classes ...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equit...
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...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
Add to ORKG