Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time. Broersma, H., Golovach, P. A., Paulusma, D., & Song, J. Theor. Comput. Sci. (TCS), 423:1-10, 2012.
Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time [link]Paper  bibtex   
@article{ dblp1625888,
  title = {Determining the chromatic number of triangle-free 2P<sub>3</sub>-free graphs in polynomial time},
  author = {Hajo Broersma and Petr A. Golovach and Daniël Paulusma and Jian Song},
  author_short = {Broersma, H. and Golovach, P. A. and Paulusma, D. and Song, J.},
  bibtype = {article},
  type = {article},
  year = {2012},
  key = {dblp1625888},
  id = {dblp1625888},
  biburl = {http://www.dblp.org/rec/bibtex/journals/tcs/BroersmaGPS12a},
  url = {http://dx.doi.org/10.1016/j.tcs.2011.12.076},
  journal = {Theor. Comput. Sci. (TCS)},
  pages = {1-10},
  volume = {423},
  text = {Theor. Comput. Sci. (TCS) 423:1-10 (2012)}
}

Downloads: 0