A note on r-equitable k-colorings of trees

A graph G = (V;E) is r-equitably k-colorable if there exists a partition of V into k independent sets V1, V2,... Vk such that ||Vi|- |Vj|| ? r for all i,j ? {1,2... k}. In this note, we show that if two trees T1 and T2 of order at least two are r-equitably k-colorable for r ? 1 and k ? 3, then all trees obtained by adding an arbitrary edge between T1 and T2 are also r-equitably k-colorable.

Abstract licence: CC BY-NC-SA

7 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.