A Quality of Caterpillars and an Explicit Formula for the Equitable Chromatic Number of Caterpillars
Sujing Zhou · He'nan kexue · 2007
A graph is equitably k-colorable if its vertices can be partitioned into k-independent sets of as near equal sizes as possible.In this paper,we obtain a quality of caterpillars and an explicit formula for the equitable chromatic number of caterpillars.