References
- B.S. Baker and E.G. Coffman, Mutual exclusion scheduling, Theoret. Comput. Sci. 162 (1996), pp. 225–243. doi: 10.1016/0304-3975(96)00031-X
- J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin, 2001.
- B. Bollobás, Modern Graph Theory, Springer-Verlag, New York, 1998.
- S.K. Das, I. Finocchi, and R. Petreschi, Conflict-free star-access in parallel memory systems, J. Parallel Distrib. Comput. 66 (2006), pp. 1431–1441. doi: 10.1016/j.jpdc.2006.06.004
- H. Fan, H.A. Kierstead, G.Z. Liu, T. Molla, J.-L. Wu, and X. Zhang, A note on relaxed equitable coloring of graphs, Inform. Process. Lett. 111 (2011), pp. 1062–1066. doi: 10.1016/j.ipl.2011.08.001
- S. Irani and V. Leung, Scheduling with conflicts and applications to traffic signal control, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, 1996, pp. 85–94.
- F. Kitagawa and H. Ikeda, An existential problem of a weight-controlled subset and its application to school timetable construction, Discrete Math. 72 (1988), pp. 195–211. doi: 10.1016/0012-365X(88)90210-5
- W. Meyer, Equitable coloring, Amer. Math. Monthly 80 (1973), pp. 143–149.
- B.F. Smith, P.E. Bjorstad, and W.D. Gropp, Domain Decomposition, Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, Cambridge, 1996, p. 224.
- A. Tucker, Perfect graphs and an application to optimizing municipal services, SIAM Rev. 15 (1973), pp. 585–590. doi: 10.1137/1015072
- W.F. Wang and K.-W. Lih, Choosability and edge choosability of planar graphs without 5-cycles, Appl. Math. Lett. 15 (2002), pp. 561–565. doi: 10.1016/S0893-9659(02)80007-6
- J.-L. Wu, X. Zhang, and H.L. Li, Equitable vertex arboricity of graphs, Discrete Math. 313 (2013), pp. 2696–2701. doi: 10.1016/j.disc.2013.08.006
- J.L. Zhu and Y.H. Bu, Equitable list colorings of planar graphs without short cycles, Theoret. Comput. Sci. 407 (2008), pp. 21–28. doi: 10.1016/j.tcs.2008.04.018