1. A general framework for coloring problems: old results, new results, and open problems;Broersma,2003
2. Backbone colorings for networks;Broersma,2003
3. λ-backbone colorings along pairwise disjoint stars and matchings;Broersma;Discrete Math.,2009
4. Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete;Dailey;Discrete Math.,1980
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979