{"type":"journal_article","date_updated":"2022-01-06T06:50:31Z","publication":"Discuss. Math. Graph Theory","page":"5-11","language":[{"iso":"eng"}],"publication_status":"published","volume":19,"_id":"10190","title":"Cyclically 5-edge connected non-bicritical critical snarks","date_created":"2019-06-07T12:41:01Z","user_id":"15540","citation":{"ieee":"S. Grünewald and E. Steffen, “Cyclically 5-edge connected non-bicritical critical snarks,” <i>Discuss. Math. Graph Theory</i>, vol. 19, pp. 5–11, 1999.","bibtex":"@article{Grünewald_Steffen_1999, title={Cyclically 5-edge connected non-bicritical critical snarks}, volume={19}, journal={Discuss. Math. Graph Theory}, author={Grünewald, Stefan and Steffen, Eckhard}, year={1999}, pages={5–11} }","ama":"Grünewald S, Steffen E. Cyclically 5-edge connected non-bicritical critical snarks. <i>Discuss Math Graph Theory</i>. 1999;19:5-11.","mla":"Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” <i>Discuss. Math. Graph Theory</i>, vol. 19, 1999, pp. 5–11.","apa":"Grünewald, S., &#38; Steffen, E. (1999). Cyclically 5-edge connected non-bicritical critical snarks. <i>Discuss. Math. Graph Theory</i>, <i>19</i>, 5–11.","short":"S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.","chicago":"Grünewald, Stefan, and Eckhard Steffen. “Cyclically 5-Edge Connected Non-Bicritical Critical Snarks.” <i>Discuss. Math. Graph Theory</i> 19 (1999): 5–11."},"year":"1999","status":"public","intvolume":"        19","author":[{"last_name":"Grünewald","full_name":"Grünewald, Stefan","first_name":"Stefan"},{"first_name":"Eckhard","id":"15548","last_name":"Steffen","full_name":"Steffen, Eckhard"}]}