Complexity of conditional colorability of graphs. Li, X., Yao, X., Zhou, W., & Broersma, H. Appl. Math. Lett. (APPML), 22(3):320-324, 2009.
Complexity of conditional colorability of graphs [link]Paper  bibtex   
@article{ dblp2047967,
  title = {Complexity of conditional colorability of graphs},
  author = {Xueliang Li and Xiangmei Yao and Wenli Zhou and Hajo Broersma},
  author_short = {Li, X. and Yao, X. and Zhou, W. and Broersma, H.},
  bibtype = {article},
  type = {article},
  year = {2009},
  key = {dblp2047967},
  id = {dblp2047967},
  biburl = {http://www.dblp.org/rec/bibtex/journals/appml/LiYZB09},
  url = {http://dx.doi.org/10.1016/j.aml.2008.04.003},
  journal = {Appl. Math. Lett. (APPML)},
  pages = {320-324},
  number = {3},
  volume = {22},
  text = {Appl. Math. Lett. (APPML) 22(3):320-324 (2009)}
}

Downloads: 0