@ARTICLE{Furmańczyk_Hanna_Equitable_2015,
 author={Furmańczyk, Hanna and Kubale, Marek},
 number={No 1},
 journal={Archives of Control Sciences},
 howpublished={online},
 year={2015},
 publisher={Committee of Automatic Control and Robotics PAS},
 abstract={Abstract In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.},
 title={Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling},
 URL={http://ochroma.man.poznan.pl/Content/84358/PDF/7.pdf},
 doi={10.1515/acsc-2015-0007},
}