Approximating the maximum 2- and 3-edge-colorable subgraph problems. Kosowski, A. Discrete Applied Mathematics (DAM), 157(17):3593-3600, 2009.
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
{"_id":"EdCGCE7gQNpzmn8Pw","authorIDs":[],"author_short":["Kosowski, A."],"bibbaseid":"kosowski-approximatingthemaximum2and3edgecolorablesubgraphproblems-2009","bibdata":{"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)","bibtex":"@article{ dblp2594145,\n title = {Approximating the maximum 2- and 3-edge-colorable subgraph problems},\n author = {Adrian Kosowski},\n author_short = {Kosowski, A.},\n bibtype = {article},\n type = {article},\n year = {2009},\n key = {dblp2594145},\n id = {dblp2594145},\n biburl = {http://www.dblp.org/rec/bibtex/journals/dam/Kosowski09b},\n url = {http://dx.doi.org/10.1016/j.dam.2009.04.002},\n journal = {Discrete Applied Mathematics (DAM)},\n pages = {3593-3600},\n number = {17},\n volume = {157},\n text = {Discrete Applied Mathematics (DAM) 157(17):3593-3600 (2009)}\n}","bibbaseid":"kosowski-approximatingthemaximum2and3edgecolorablesubgraphproblems-2009","role":"author","urls":{"Paper":"http://dx.doi.org/10.1016/j.dam.2009.04.002"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/dam/Kosowski09b","creationDate":"2014-12-16T15:02:53.122Z","downloads":0,"keywords":[],"search_terms":["approximating","maximum","edge","colorable","subgraph","problems","kosowski"],"title":"Approximating the maximum 2- and 3-edge-colorable subgraph problems","year":2009,"dataSources":["GcczrGhpcHeGrfFdw"]}