AbstractWe show that almost all trees can be equitably 3-colored, that is, with three color classes of cardinalities differing by at most one. Also, except in some extreme cases, they can be 3-colored with color classes of sizes in given proportions
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
A Steiner triple system, STS(v), is said to be χ-chromatic if the points can be coloured using χ col...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
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 graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
AbstractA labeling of a graph is a function f from the vertex set to some subset of the natural numb...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
SubmittedNational audienceGiven a tree T with n vertices and three nonnegativeintegers (n1,n2,n3) su...
International audienceA graph G = (V, E) is r-equitably k-colorable if there exists a partition of V...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
A Steiner triple system, STS(v), is said to be χ-chromatic if the points can be coloured using χ col...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
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 graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
AbstractA labeling of a graph is a function f from the vertex set to some subset of the natural numb...
AbstractA proper coloring of a graph G is equitable if the sizes of any two color classes differ by ...
AbstractThis note gives a short proof on characterizations for a forest to be equitably k-colorable
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
SubmittedNational audienceGiven a tree T with n vertices and three nonnegativeintegers (n1,n2,n3) su...
International audienceA graph G = (V, E) is r-equitably k-colorable if there exists a partition of V...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
A Steiner triple system, STS(v), is said to be χ-chromatic if the points can be coloured using χ col...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
DOI
Add to ORKG