Equitable Colorings of Bounded Treewidth Graphs. Bodlaender, H. L. & Fomin, F. V. In Proceedings of Mathematical Foundations of Computer Science (MFCS), pages 180-190, 2004. ![Equitable Colorings of Bounded Treewidth Graphs [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @inproceedings{ dblp4036529,
title = {Equitable Colorings of Bounded Treewidth Graphs},
author = {Hans L. Bodlaender and Fedor V. Fomin},
author_short = {Bodlaender, H. L. and Fomin, F. V.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2004},
key = {dblp4036529},
id = {dblp4036529},
biburl = {http://www.dblp.org/rec/bibtex/conf/mfcs/BodlaenderF04},
url = {http://dx.doi.org/10.1007/978-3-540-28629-5_11},
conference = {MFCS},
pages = {180-190},
text = {MFCS 2004:180-190},
booktitle = {Proceedings of Mathematical Foundations of Computer Science (MFCS)}
}
Downloads: 0
{"_id":"ubjmEP6W2Rf5ivd4X","bibbaseid":"bodlaender-fomin-equitablecoloringsofboundedtreewidthgraphs-2004","downloads":0,"creationDate":"2015-06-23T17:42:40.139Z","title":"Equitable Colorings of Bounded Treewidth Graphs","author_short":["Bodlaender, H. L.","Fomin, F. V."],"year":2004,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/mfcs/BodlaenderF04","bibdata":{"title":"Equitable Colorings of Bounded Treewidth Graphs","author":["Hans L. Bodlaender","Fedor V. Fomin"],"author_short":["Bodlaender, H. L.","Fomin, F. V."],"bibtype":"inproceedings","type":"inproceedings","year":"2004","key":"dblp4036529","id":"dblp4036529","biburl":"http://www.dblp.org/rec/bibtex/conf/mfcs/BodlaenderF04","url":"http://dx.doi.org/10.1007/978-3-540-28629-5_11","conference":"MFCS","pages":"180-190","text":"MFCS 2004:180-190","booktitle":"Proceedings of Mathematical Foundations of Computer Science (MFCS)","bibtex":"@inproceedings{ dblp4036529,\n title = {Equitable Colorings of Bounded Treewidth Graphs},\n author = {Hans L. Bodlaender and Fedor V. Fomin},\n author_short = {Bodlaender, H. L. and Fomin, F. V.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2004},\n key = {dblp4036529},\n id = {dblp4036529},\n biburl = {http://www.dblp.org/rec/bibtex/conf/mfcs/BodlaenderF04},\n url = {http://dx.doi.org/10.1007/978-3-540-28629-5_11},\n conference = {MFCS},\n pages = {180-190},\n text = {MFCS 2004:180-190},\n booktitle = {Proceedings of Mathematical Foundations of Computer Science (MFCS)}\n}","bibbaseid":"bodlaender-fomin-equitablecoloringsofboundedtreewidthgraphs-2004","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-540-28629-5_11"},"downloads":0},"search_terms":["equitable","colorings","bounded","treewidth","graphs","bodlaender","fomin"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["TfQSRL5uENFWr7b5z"]}