Approximating the maximum 2- and 3-edge-colorable subgraph problems. Kosowski, A. Discrete Applied Mathematics (DAM), 157(17):3593-3600, 2009.
Approximating the maximum 2- and 3-edge-colorable subgraph problems [link]Paper  bibtex   
@article{ dblp2594145,
  title = {Approximating the maximum 2- and 3-edge-colorable subgraph problems},
  author = {Adrian Kosowski},
  author_short = {Kosowski, A.},
  bibtype = {article},
  type = {article},
  year = {2009},
  key = {dblp2594145},
  id = {dblp2594145},
  biburl = {http://www.dblp.org/rec/bibtex/journals/dam/Kosowski09b},
  url = {http://dx.doi.org/10.1016/j.dam.2009.04.002},
  journal = {Discrete Applied Mathematics (DAM)},
  pages = {3593-3600},
  number = {17},
  volume = {157},
  text = {Discrete Applied Mathematics (DAM) 157(17):3593-3600 (2009)}
}

Downloads: 0