@article{journals/dm/KiersteadR96,
  added-at = {2020-02-22T00:00:00.000+0100},
  author = {Kierstead, Hal A. and Rödl, Vojtech},
  biburl = {https://www.bibsonomy.org/bibtex/2f66a036d4430ef5fb33b0659aeacbc62/dblp},
  ee = {https://doi.org/10.1016/0012-365X(95)00187-2},
  interhash = {070b4eadaccb41577837565c1adadcae},
  intrahash = {f66a036d4430ef5fb33b0659aeacbc62},
  journal = {Discret. Math.},
  keywords = {dblp},
  number = {1-3},
  pages = {187-193},
  timestamp = {2020-02-25T13:48:47.000+0100},
  title = {Applications of hypergraph coloring to coloring graphs not inducing certain trees.},
  url = {http://dblp.uni-trier.de/db/journals/dm/dm150.html#KiersteadR96},
  volume = 150,
  year = 1996
}

{"_id":"yGARLT6CYiGTtQwBL","bibbaseid":"kierstead-rdl-applicationsofhypergraphcoloringtocoloringgraphsnotinducingcertaintrees-1996","author_short":["Kierstead, H. A.","Rödl, V."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-02-22T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Kierstead"],"firstnames":["Hal","A."],"suffixes":[]},{"propositions":[],"lastnames":["Rödl"],"firstnames":["Vojtech"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2f66a036d4430ef5fb33b0659aeacbc62/dblp","ee":"https://doi.org/10.1016/0012-365X(95)00187-2","interhash":"070b4eadaccb41577837565c1adadcae","intrahash":"f66a036d4430ef5fb33b0659aeacbc62","journal":"Discret. Math.","keywords":"dblp","number":"1-3","pages":"187-193","timestamp":"2020-02-25T13:48:47.000+0100","title":"Applications of hypergraph coloring to coloring graphs not inducing certain trees.","url":"http://dblp.uni-trier.de/db/journals/dm/dm150.html#KiersteadR96","volume":"150","year":"1996","bibtex":"@article{journals/dm/KiersteadR96,\n added-at = {2020-02-22T00:00:00.000+0100},\n author = {Kierstead, Hal A. and Rödl, Vojtech},\n biburl = {https://www.bibsonomy.org/bibtex/2f66a036d4430ef5fb33b0659aeacbc62/dblp},\n ee = {https://doi.org/10.1016/0012-365X(95)00187-2},\n interhash = {070b4eadaccb41577837565c1adadcae},\n intrahash = {f66a036d4430ef5fb33b0659aeacbc62},\n journal = {Discret. Math.},\n keywords = {dblp},\n number = {1-3},\n pages = {187-193},\n timestamp = {2020-02-25T13:48:47.000+0100},\n title = {Applications of hypergraph coloring to coloring graphs not inducing certain trees.},\n url = {http://dblp.uni-trier.de/db/journals/dm/dm150.html#KiersteadR96},\n volume = 150,\n year = 1996\n}\n\n","author_short":["Kierstead, H. A.","Rödl, V."],"key":"journals/dm/KiersteadR96","id":"journals/dm/KiersteadR96","bibbaseid":"kierstead-rdl-applicationsofhypergraphcoloringtocoloringgraphsnotinducingcertaintrees-1996","role":"author","urls":{"Link":"https://doi.org/10.1016/0012-365X(95)00187-2","Paper":"http://dblp.uni-trier.de/db/journals/dm/dm150.html#KiersteadR96"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Hal?items=1000","dataSources":["Jy4SyfFmJfDm4DM2r"],"keywords":["dblp"],"search_terms":["applications","hypergraph","coloring","coloring","graphs","inducing","certain","trees","kierstead","rödl"],"title":"Applications of hypergraph coloring to coloring graphs not inducing certain trees.","year":1996}