[{"publication":"Jahresband Usability Professionals","citation":{"ieee":"H. G. Fischer, C. Bogner, T. Geis, K. Polkehn, and D. Zimmermann, “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten,” in <i>Jahresband Usability Professionals</i>, 2011, pp. 72–74.","apa":"Fischer, H. G., Bogner, C., Geis, T., Polkehn, K., &#38; Zimmermann, D. (2011). Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In <i>Jahresband Usability Professionals</i> (pp. 72–74). German UPA.","chicago":"Fischer, Holger Gerhard, Christian Bogner, Thomas Geis, Knut Polkehn, and Dirk Zimmermann. “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten.” In <i>Jahresband Usability Professionals</i>, 72–74. German UPA, 2011.","short":"H.G. Fischer, C. Bogner, T. Geis, K. Polkehn, D. Zimmermann, in: Jahresband Usability Professionals, German UPA, 2011, pp. 72–74.","mla":"Fischer, Holger Gerhard, et al. “Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten.” <i>Jahresband Usability Professionals</i>, German UPA, 2011, pp. 72–74.","bibtex":"@inproceedings{Fischer_Bogner_Geis_Polkehn_Zimmermann_2011, title={Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}, booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer, Holger Gerhard and Bogner, Christian and Geis, Thomas and Polkehn, Knut and Zimmermann, Dirk}, year={2011}, pages={72–74} }","ama":"Fischer HG, Bogner C, Geis T, Polkehn K, Zimmermann D. Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten. In: <i>Jahresband Usability Professionals</i>. German UPA; 2011:72-74."},"date_created":"2018-12-18T13:07:07Z","type":"conference","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"status":"public","year":"2011","title":"Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten","author":[{"id":"30457","first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard"},{"last_name":"Bogner","first_name":"Christian","full_name":"Bogner, Christian"},{"full_name":"Geis, Thomas","first_name":"Thomas","last_name":"Geis"},{"full_name":"Polkehn, Knut","first_name":"Knut","last_name":"Polkehn"},{"first_name":"Dirk","last_name":"Zimmermann","full_name":"Zimmermann, Dirk"}],"date_updated":"2022-01-06T07:03:00Z","page":"72-74","language":[{"iso":"ger"}],"_id":"6301","publisher":"German UPA","user_id":"30457"},{"volume":310,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10174","page":"385 - 389","intvolume":"       310","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"status":"public","year":"2010","title":"Tutte's 5-flow conjecture for cyclically highly connected cubic graphs","type":"journal_article","date_created":"2019-06-07T11:53:30Z","citation":{"mla":"Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Cyclically Highly Connected Cubic Graphs.” <i>Discrete Mathematics</i>, vol. 310, 2010, pp. 385–89.","bibtex":"@article{Steffen_2010, title={Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs}, volume={310}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2010}, pages={385–389} }","ama":"Steffen E. Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs. <i>Discrete Mathematics</i>. 2010;310:385-389.","ieee":"E. Steffen, “Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs,” <i>Discrete Mathematics</i>, vol. 310, pp. 385–389, 2010.","apa":"Steffen, E. (2010). Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs. <i>Discrete Mathematics</i>, <i>310</i>, 385–389.","short":"E. Steffen, Discrete Mathematics 310 (2010) 385–389.","chicago":"Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Cyclically Highly Connected Cubic Graphs.” <i>Discrete Mathematics</i> 310 (2010): 385–89."},"publication":"Discrete Mathematics"},{"language":[{"iso":"eng"}],"_id":"10202","user_id":"15540","author":[{"first_name":"Vahan","last_name":"Mkrtchyan","full_name":"Mkrtchyan, Vahan"},{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"year":"2010","status":"public","title":"Bricks and conjectures of Berge, Fulkerson and Seymour","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T13:10:04Z","type":"preprint","citation":{"ama":"Mkrtchyan V, Steffen E. Bricks and conjectures of Berge, Fulkerson and Seymour. <i>arXiv:10035782</i>. 2010.","bibtex":"@article{Mkrtchyan_Steffen_2010, title={Bricks and conjectures of Berge, Fulkerson and Seymour}, journal={arXiv:1003.5782}, author={Mkrtchyan, Vahan and Steffen, Eckhard}, year={2010} }","mla":"Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” <i>ArXiv:1003.5782</i>, 2010.","chicago":"Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” <i>ArXiv:1003.5782</i>, 2010.","short":"V. Mkrtchyan, E. Steffen, ArXiv:1003.5782 (2010).","apa":"Mkrtchyan, V., &#38; Steffen, E. (2010). Bricks and conjectures of Berge, Fulkerson and Seymour. <i>ArXiv:1003.5782</i>.","ieee":"V. Mkrtchyan and E. Steffen, “Bricks and conjectures of Berge, Fulkerson and Seymour,” <i>arXiv:1003.5782</i>. 2010."},"publication":"arXiv:1003.5782","abstract":[{"lang":"eng","text":"An $r$-graph is an $r$-regular graph where every odd set of vertices is\r\nconnected by at least $r$ edges to the rest of the graph. Seymour conjectured\r\nthat any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph\r\ncontains $2r$ perfect matchings such that each edge belongs to two of them. We\r\nshow that the minimum counter-example to either of these conjectures is a\r\nbrick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud."}]},{"user_id":"15540","volume":1,"page":"169-184","language":[{"iso":"eng"}],"_id":"10175","date_updated":"2022-01-06T06:50:31Z","intvolume":"         1","year":"2008","title":"Relating embedding and coloring properties of snarks","status":"public","author":[{"full_name":"Mohar, Bojan","last_name":"Mohar","first_name":"Bojan"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"},{"first_name":"Andrej","last_name":"Vodopivec","full_name":"Vodopivec, Andrej"}],"type":"journal_article","date_created":"2019-06-07T11:55:12Z","publication":"Ars Mathematica Contemporanea","citation":{"ieee":"B. Mohar, E. Steffen, and A. Vodopivec, “Relating embedding and coloring properties of snarks,” <i>Ars Mathematica Contemporanea</i>, vol. 1, pp. 169–184, 2008.","apa":"Mohar, B., Steffen, E., &#38; Vodopivec, A. (2008). Relating embedding and coloring properties of snarks. <i>Ars Mathematica Contemporanea</i>, <i>1</i>, 169–184.","chicago":"Mohar, Bojan, Eckhard Steffen, and Andrej Vodopivec. “Relating Embedding and Coloring Properties of Snarks.” <i>Ars Mathematica Contemporanea</i> 1 (2008): 169–84.","short":"B. Mohar, E. Steffen, A. Vodopivec, Ars Mathematica Contemporanea 1 (2008) 169–184.","mla":"Mohar, Bojan, et al. “Relating Embedding and Coloring Properties of Snarks.” <i>Ars Mathematica Contemporanea</i>, vol. 1, 2008, pp. 169–84.","bibtex":"@article{Mohar_Steffen_Vodopivec_2008, title={Relating embedding and coloring properties of snarks}, volume={1}, journal={Ars Mathematica Contemporanea}, author={Mohar, Bojan and Steffen, Eckhard and Vodopivec, Andrej}, year={2008}, pages={169–184} }","ama":"Mohar B, Steffen E, Vodopivec A. Relating embedding and coloring properties of snarks. <i>Ars Mathematica Contemporanea</i>. 2008;1:169-184."}},{"_id":"10176","language":[{"iso":"eng"}],"page":"1645 -1646","volume":154,"user_id":"15540","author":[{"full_name":"Boben, Marco","first_name":"Marco","last_name":"Boben"},{"full_name":"Pisanski, Tomaž ","last_name":"Pisanski","first_name":"Tomaž "},{"last_name":"Ravnik","first_name":"Natasa","full_name":"Ravnik, Natasa"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"year":"2006","status":"public","title":"Erratum to „Reductions of Symmetry configurations n3","intvolume":"       154","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T12:03:43Z","type":"journal_article","citation":{"apa":"Boben, M., Pisanski, T., Ravnik, N., &#38; Steffen, E. (2006). Erratum to „Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>, <i>154</i>(11), 1645–1646.","ieee":"M. Boben, T. Pisanski, N. Ravnik, and E. Steffen, “Erratum to „Reductions of Symmetry configurations n3,” <i>Discrete Applied Mathematics</i>, vol. 154, no. 11, pp. 1645–1646, 2006.","chicago":"Boben, Marco, Tomaž  Pisanski, Natasa Ravnik, and Eckhard Steffen. “Erratum to „Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i> 154, no. 11 (2006): 1645–46.","short":"M. Boben, T. Pisanski, N. Ravnik, E. Steffen, Discrete Applied Mathematics 154 (2006) 1645–1646.","mla":"Boben, Marco, et al. “Erratum to „Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i>, vol. 154, no. 11, 2006, pp. 1645–46.","ama":"Boben M, Pisanski T, Ravnik N, Steffen E. Erratum to „Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>. 2006;154(11):1645-1646.","bibtex":"@article{Boben_Pisanski_Ravnik_Steffen_2006, title={Erratum to „Reductions of Symmetry configurations n3}, volume={154}, number={11}, journal={Discrete Applied Mathematics}, author={Boben, Marco and Pisanski, Tomaž  and Ravnik, Natasa and Steffen, Eckhard}, year={2006}, pages={1645–1646} }"},"issue":"11","publication":"Discrete Applied Mathematics"},{"publication":"Discrete Mathematics","citation":{"ama":"Steffen E. Measurements of edge-uncolorability. <i>Discrete Mathematics</i>. 2004;280:191-214.","bibtex":"@article{Steffen_2004, title={Measurements of edge-uncolorability}, volume={280}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2004}, pages={191–214} }","mla":"Steffen, Eckhard. “Measurements of Edge-Uncolorability.” <i>Discrete Mathematics</i>, vol. 280, 2004, pp. 191–214.","chicago":"Steffen, Eckhard. “Measurements of Edge-Uncolorability.” <i>Discrete Mathematics</i> 280 (2004): 191–214.","short":"E. Steffen, Discrete Mathematics 280 (2004) 191–214.","apa":"Steffen, E. (2004). Measurements of edge-uncolorability. <i>Discrete Mathematics</i>, <i>280</i>, 191–214.","ieee":"E. Steffen, “Measurements of edge-uncolorability,” <i>Discrete Mathematics</i>, vol. 280, pp. 191–214, 2004."},"date_created":"2019-06-07T12:07:05Z","type":"journal_article","status":"public","year":"2004","title":"Measurements of edge-uncolorability","author":[{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"       280","page":"191 - 214","language":[{"iso":"eng"}],"_id":"10177","user_id":"15540","volume":280},{"status":"public","year":"2004","title":"Independent Sets and 2-factors in edge-chromatic critical graphs","author":[{"full_name":"Grünewald, Stefan","first_name":"Stefan","last_name":"Grünewald"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        45","page":"113 -118","language":[{"iso":"eng"}],"_id":"10178","user_id":"15540","volume":45,"publication":"J. Graph Theory","citation":{"mla":"Grünewald, Stefan, and Eckhard Steffen. “Independent Sets and 2-Factors in Edge-Chromatic Critical Graphs.” <i>J. Graph Theory</i>, vol. 45, 2004, pp. 113–18.","ama":"Grünewald S, Steffen E. Independent Sets and 2-factors in edge-chromatic critical graphs. <i>J Graph Theory</i>. 2004;45:113-118.","bibtex":"@article{Grünewald_Steffen_2004, title={Independent Sets and 2-factors in edge-chromatic critical graphs}, volume={45}, journal={J. Graph Theory}, author={Grünewald, Stefan and Steffen, Eckhard}, year={2004}, pages={113–118} }","apa":"Grünewald, S., &#38; Steffen, E. (2004). Independent Sets and 2-factors in edge-chromatic critical graphs. <i>J. Graph Theory</i>, <i>45</i>, 113–118.","ieee":"S. Grünewald and E. Steffen, “Independent Sets and 2-factors in edge-chromatic critical graphs,” <i>J. Graph Theory</i>, vol. 45, pp. 113–118, 2004.","chicago":"Grünewald, Stefan, and Eckhard Steffen. “Independent Sets and 2-Factors in Edge-Chromatic Critical Graphs.” <i>J. Graph Theory</i> 45 (2004): 113–18.","short":"S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118."},"date_created":"2019-06-07T12:08:31Z","type":"journal_article"},{"type":"journal_article","date_created":"2019-06-07T12:09:37Z","citation":{"ama":"Steffen E. Circular flow numbers of regular multigraphs. <i>J Graph Theory</i>. 2001;36:24-34.","bibtex":"@article{Steffen_2001, title={Circular flow numbers of regular multigraphs}, volume={36}, journal={J. Graph Theory}, author={Steffen, Eckhard}, year={2001}, pages={24–34} }","mla":"Steffen, Eckhard. “Circular Flow Numbers of Regular Multigraphs.” <i>J. Graph Theory</i>, vol. 36, 2001, pp. 24–34.","chicago":"Steffen, Eckhard. “Circular Flow Numbers of Regular Multigraphs.” <i>J. Graph Theory</i> 36 (2001): 24–34.","short":"E. Steffen, J. Graph Theory 36 (2001) 24–34.","apa":"Steffen, E. (2001). Circular flow numbers of regular multigraphs. <i>J. Graph Theory</i>, <i>36</i>, 24–34.","ieee":"E. Steffen, “Circular flow numbers of regular multigraphs,” <i>J. Graph Theory</i>, vol. 36, pp. 24–34, 2001."},"publication":"J. Graph Theory","volume":36,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10179","page":"24 - 34","intvolume":"        36","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"year":"2001","title":"Circular flow numbers of regular multigraphs","status":"public"},{"page":"141 -150","_id":"10180","language":[{"iso":"eng"}],"user_id":"15540","volume":51,"year":"2001","title":"On bicritical snarks","status":"public","author":[{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        51","date_created":"2019-06-07T12:24:44Z","type":"journal_article","publication":"Math. Slovaca","citation":{"mla":"Steffen, Eckhard. “On Bicritical Snarks.” <i>Math. Slovaca</i>, vol. 51, 2001, pp. 141–50.","ama":"Steffen E. On bicritical snarks. <i>Math Slovaca</i>. 2001;51:141-150.","bibtex":"@article{Steffen_2001, title={On bicritical snarks}, volume={51}, journal={Math. Slovaca}, author={Steffen, Eckhard}, year={2001}, pages={141–150} }","apa":"Steffen, E. (2001). On bicritical snarks. <i>Math. Slovaca</i>, <i>51</i>, 141–150.","ieee":"E. Steffen, “On bicritical snarks,” <i>Math. Slovaca</i>, vol. 51, pp. 141–150, 2001.","short":"E. Steffen, Math. Slovaca 51 (2001) 141–150.","chicago":"Steffen, Eckhard. “On Bicritical Snarks.” <i>Math. Slovaca</i> 51 (2001): 141–50."}},{"type":"journal_article","date_created":"2019-06-07T12:29:36Z","citation":{"chicago":"Brinkmann, Gunnar, Sheshayya A Choudum, Stefan Grünewald, and Eckhard Steffen. “Bounds for the Independence Number of Critical Graphs.” <i>Bull. London Math. Soc.</i> 32 (2000): 137–40.","short":"G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.","apa":"Brinkmann, G., Choudum, S. A., Grünewald, S., &#38; Steffen, E. (2000). Bounds for the independence number of critical graphs. <i>Bull. London Math. Soc.</i>, <i>32</i>, 137–140.","ieee":"G. Brinkmann, S. A. Choudum, S. Grünewald, and E. Steffen, “Bounds for the independence number of critical graphs,” <i>Bull. London Math. Soc.</i>, vol. 32, pp. 137–140, 2000.","ama":"Brinkmann G, Choudum SA, Grünewald S, Steffen E. Bounds for the independence number of critical graphs. <i>Bull London Math Soc</i>. 2000;32:137-140.","bibtex":"@article{Brinkmann_Choudum_Grünewald_Steffen_2000, title={Bounds for the independence number of critical graphs}, volume={32}, journal={Bull. London Math. Soc.}, author={Brinkmann, Gunnar and Choudum, Sheshayya A and Grünewald, Stefan and Steffen, Eckhard}, year={2000}, pages={137–140} }","mla":"Brinkmann, Gunnar, et al. “Bounds for the Independence Number of Critical Graphs.” <i>Bull. London Math. Soc.</i>, vol. 32, 2000, pp. 137–40."},"publication":"Bull. London Math. Soc.","volume":32,"user_id":"15540","_id":"10182","language":[{"iso":"eng"}],"page":"137 -140","intvolume":"        32","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"first_name":"Gunnar","last_name":"Brinkmann","full_name":"Brinkmann, Gunnar"},{"full_name":"Choudum, Sheshayya A","first_name":"Sheshayya A","last_name":"Choudum"},{"first_name":"Stefan","last_name":"Grünewald","full_name":"Grünewald, Stefan"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"title":"Bounds for the independence number of critical graphs","year":"2000","status":"public"},{"user_id":"15540","volume":218,"page":"289 - 291","language":[{"iso":"eng"}],"_id":"10183","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       218","year":"2000","title":"A refinement of Vizing's theorem","status":"public","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"type":"journal_article","date_created":"2019-06-07T12:31:13Z","publication":"Discrete Mathematics","citation":{"bibtex":"@article{Steffen_2000, title={A refinement of Vizing’s theorem}, volume={218}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2000}, pages={289–291} }","ama":"Steffen E. A refinement of Vizing’s theorem. <i>Discrete Mathematics</i>. 2000;218:289-291.","mla":"Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” <i>Discrete Mathematics</i>, vol. 218, 2000, pp. 289–91.","chicago":"Steffen, Eckhard. “A Refinement of Vizing’s Theorem.” <i>Discrete Mathematics</i> 218 (2000): 289–91.","short":"E. Steffen, Discrete Mathematics 218 (2000) 289–291.","ieee":"E. Steffen, “A refinement of Vizing’s theorem,” <i>Discrete Mathematics</i>, vol. 218, pp. 289–291, 2000.","apa":"Steffen, E. (2000). A refinement of Vizing’s theorem. <i>Discrete Mathematics</i>, <i>218</i>, 289–291."}},{"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        99","title":"Reductions of Symmetry configurations n3","status":"public","year":"2000","author":[{"full_name":"Carstens, Hans Georg","first_name":"Hans Georg","last_name":"Carstens"},{"first_name":"Thomas","last_name":"Dinski","full_name":"Dinski, Thomas"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"user_id":"15540","volume":99,"page":"401-411","_id":"10186","language":[{"iso":"eng"}],"publication":"Discrete Applied Mathematics","citation":{"apa":"Carstens, H. G., Dinski, T., &#38; Steffen, E. (2000). Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>, <i>99</i>, 401–411.","mla":"Carstens, Hans Georg, et al. “Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i>, vol. 99, 2000, pp. 401–11.","ieee":"H. G. Carstens, T. Dinski, and E. Steffen, “Reductions of Symmetry configurations n3,” <i>Discrete Applied Mathematics</i>, vol. 99, pp. 401–411, 2000.","short":"H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.","ama":"Carstens HG, Dinski T, Steffen E. Reductions of Symmetry configurations n3. <i>Discrete Applied Mathematics</i>. 2000;99:401-411.","chicago":"Carstens, Hans Georg, Thomas Dinski, and Eckhard Steffen. “Reductions of Symmetry Configurations N3.” <i>Discrete Applied Mathematics</i> 99 (2000): 401–11.","bibtex":"@article{Carstens_Dinski_Steffen_2000, title={Reductions of Symmetry configurations n3}, volume={99}, journal={Discrete Applied Mathematics}, author={Carstens, Hans Georg and Dinski, Thomas and Steffen, Eckhard}, year={2000}, pages={401–411} }"},"type":"journal_article","date_created":"2019-06-07T12:36:50Z"},{"type":"journal_article","date_created":"2019-06-07T12:38:49Z","publication":"Discrete Mathematics","citation":{"bibtex":"@article{Steffen_1999, title={Counterexamples to a conjecture about Petersen-minors in supersnarks}, volume={207}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={1999}, pages={291–292} }","ama":"Steffen E. Counterexamples to a conjecture about Petersen-minors in supersnarks. <i>Discrete Mathematics</i>. 1999;207:291-292.","mla":"Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” <i>Discrete Mathematics</i>, vol. 207, 1999, pp. 291–92.","chicago":"Steffen, Eckhard. “Counterexamples to a Conjecture about Petersen-Minors in Supersnarks.” <i>Discrete Mathematics</i> 207 (1999): 291–92.","short":"E. Steffen, Discrete Mathematics 207 (1999) 291–292.","ieee":"E. Steffen, “Counterexamples to a conjecture about Petersen-minors in supersnarks,” <i>Discrete Mathematics</i>, vol. 207, pp. 291–292, 1999.","apa":"Steffen, E. (1999). Counterexamples to a conjecture about Petersen-minors in supersnarks. <i>Discrete Mathematics</i>, <i>207</i>, 291–292."},"user_id":"15540","volume":207,"page":"291-292","language":[{"iso":"eng"}],"_id":"10187","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       207","title":"Counterexamples to a conjecture about Petersen-minors in supersnarks","status":"public","year":"1999","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}]},{"_id":"10189","language":[{"iso":"eng"}],"page":" 473-480","volume":15,"user_id":"15540","author":[{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"year":"1999","status":"public","title":"Non-bicritical critical snarks","intvolume":"        15","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","date_created":"2019-06-07T12:39:54Z","type":"journal_article","citation":{"mla":"Steffen, Eckhard. “Non-Bicritical Critical Snarks.” <i>Graphs Comb.</i>, vol. 15, 1999, pp. 473–80.","bibtex":"@article{Steffen_1999, title={Non-bicritical critical snarks}, volume={15}, journal={Graphs Comb.}, author={Steffen, Eckhard}, year={1999}, pages={473–480} }","ama":"Steffen E. Non-bicritical critical snarks. <i>Graphs Comb</i>. 1999;15:473-480.","ieee":"E. Steffen, “Non-bicritical critical snarks,” <i>Graphs Comb.</i>, vol. 15, pp. 473–480, 1999.","apa":"Steffen, E. (1999). Non-bicritical critical snarks. <i>Graphs Comb.</i>, <i>15</i>, 473–480.","short":"E. Steffen, Graphs Comb. 15 (1999) 473–480.","chicago":"Steffen, Eckhard. “Non-Bicritical Critical Snarks.” <i>Graphs Comb.</i> 15 (1999): 473–80."},"publication":"Graphs Comb."},{"_id":"10190","language":[{"iso":"eng"}],"page":"5-11","volume":19,"user_id":"15540","author":[{"last_name":"Grünewald","first_name":"Stefan","full_name":"Grünewald, Stefan"},{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"title":"Cyclically 5-edge connected non-bicritical critical snarks","year":"1999","status":"public","intvolume":"        19","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T12:41:01Z","type":"journal_article","citation":{"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.","short":"S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.","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.","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.","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."},"publication":"Discuss. Math. Graph Theory"},{"status":"public","title":"Chromatic-index-critical graphs of even order","year":"1999","author":[{"last_name":"Grünewald","first_name":"Stefan","full_name":"Grünewald, Stefan"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        30","page":"27 -36","_id":"10191","language":[{"iso":"eng"}],"user_id":"15540","volume":30,"publication":"J. Graph Theory","citation":{"mla":"Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” <i>J. Graph Theory</i>, vol. 30, 1999, pp. 27–36.","ama":"Grünewald S, Steffen E. Chromatic-index-critical graphs of even order. <i>J Graph Theory</i>. 1999;30:27-36.","bibtex":"@article{Grünewald_Steffen_1999, title={Chromatic-index-critical graphs of even order}, volume={30}, journal={J. Graph Theory}, author={Grünewald, Stefan and Steffen, Eckhard}, year={1999}, pages={27–36} }","apa":"Grünewald, S., &#38; Steffen, E. (1999). Chromatic-index-critical graphs of even order. <i>J. Graph Theory</i>, <i>30</i>, 27–36.","ieee":"S. Grünewald and E. Steffen, “Chromatic-index-critical graphs of even order,” <i>J. Graph Theory</i>, vol. 30, pp. 27–36, 1999.","chicago":"Grünewald, Stefan, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Even Order.” <i>J. Graph Theory</i> 30 (1999): 27–36.","short":"S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36."},"date_created":"2019-06-07T12:42:13Z","type":"journal_article"},{"date_created":"2019-06-07T12:53:52Z","type":"journal_article","citation":{"ieee":"G. Brinkmann and E. Steffen, “Snarks and reducibility,” <i>Ars Combinatoria</i>, vol. 50, pp. 292–296, 1998.","apa":"Brinkmann, G., &#38; Steffen, E. (1998). Snarks and reducibility. <i>Ars Combinatoria</i>, <i>50</i>, 292–296.","short":"G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.","chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” <i>Ars Combinatoria</i> 50 (1998): 292–96.","mla":"Brinkmann, Gunnar, and Eckhard Steffen. “Snarks and Reducibility.” <i>Ars Combinatoria</i>, vol. 50, 1998, pp. 292–96.","bibtex":"@article{Brinkmann_Steffen_1998, title={Snarks and reducibility}, volume={50}, journal={Ars Combinatoria}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1998}, pages={292–296} }","ama":"Brinkmann G, Steffen E. Snarks and reducibility. <i>Ars Combinatoria</i>. 1998;50:292-296."},"publication":"Ars Combinatoria","language":[{"iso":"eng"}],"_id":"10193","page":"292 - 296","volume":50,"user_id":"15540","author":[{"full_name":"Brinkmann, Gunnar","first_name":"Gunnar","last_name":"Brinkmann"},{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"status":"public","year":"1998","title":"Snarks and reducibility","intvolume":"        50","date_updated":"2022-01-06T06:50:31Z","publication_status":"published"},{"publication":"European J. Combinatorics","citation":{"short":"G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.","chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” <i>European J. Combinatorics</i> 19 (1998): 889–900.","ieee":"G. Brinkmann and E. Steffen, “Chromatic-index-critical graphs of Orders 11 and 12,” <i>European J. Combinatorics</i>, vol. 19, pp. 889–900, 1998.","apa":"Brinkmann, G., &#38; Steffen, E. (1998). Chromatic-index-critical graphs of Orders 11 and 12. <i>European J. Combinatorics</i>, <i>19</i>, 889–900.","bibtex":"@article{Brinkmann_Steffen_1998, title={Chromatic-index-critical graphs of Orders 11 and 12}, volume={19}, journal={European J. Combinatorics}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1998}, pages={889–900} }","ama":"Brinkmann G, Steffen E. Chromatic-index-critical graphs of Orders 11 and 12. <i>European J Combinatorics</i>. 1998;19:889-900.","mla":"Brinkmann, Gunnar, and Eckhard Steffen. “Chromatic-Index-Critical Graphs of Orders 11 and 12.” <i>European J. Combinatorics</i>, vol. 19, 1998, pp. 889–900."},"date_created":"2019-06-07T12:55:07Z","type":"journal_article","title":"Chromatic-index-critical graphs of Orders 11 and 12","status":"public","year":"1998","author":[{"full_name":"Brinkmann, Gunnar","first_name":"Gunnar","last_name":"Brinkmann"},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        19","page":"889 - 900","language":[{"iso":"eng"}],"_id":"10194","user_id":"15540","volume":19},{"type":"journal_article","date_created":"2019-06-07T12:56:23Z","citation":{"apa":"Steffen, E. (1998). Classification and characterizations of snarkse. <i>Discrete Mathematics</i>, <i>188</i>, 183-203 (.","ieee":"E. Steffen, “Classification and characterizations of snarkse,” <i>Discrete Mathematics</i>, vol. 188, pp. 183-203 (, 1998.","short":"E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.","chicago":"Steffen, Eckhard. “Classification and Characterizations of Snarkse.” <i>Discrete Mathematics</i> 188 (1998): 183-203 (.","mla":"Steffen, Eckhard. “Classification and Characterizations of Snarkse.” <i>Discrete Mathematics</i>, vol. 188, 1998, pp. 183-203 (.","ama":"Steffen E. Classification and characterizations of snarkse. <i>Discrete Mathematics</i>. 1998;188:183-203 (.","bibtex":"@article{Steffen_1998, title={Classification and characterizations of snarkse}, volume={188}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={1998}, pages={183-203 (} }"},"publication":"Discrete Mathematics","volume":188,"user_id":"15540","_id":"10195","language":[{"iso":"eng"}],"page":"183 - 203 (","intvolume":"       188","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"year":"1998","title":"Classification and characterizations of snarkse","status":"public"},{"volume":188,"user_id":"15540","_id":"10196","language":[{"iso":"eng"}],"page":" 193 -197","intvolume":"       188","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"full_name":"Brinkmann, Gunnar","last_name":"Brinkmann","first_name":"Gunnar"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"status":"public","title":"3- and 4-critical graphs of small even order","year":"1997","type":"journal_article","date_created":"2019-06-07T12:57:46Z","citation":{"apa":"Brinkmann, G., &#38; Steffen, E. (1997). 3- and 4-critical graphs of small even order. <i>Discrete Mathematics</i>, <i>188</i>, 193–197.","ieee":"G. Brinkmann and E. Steffen, “3- and 4-critical graphs of small even order,” <i>Discrete Mathematics</i>, vol. 188, pp. 193–197, 1997.","short":"G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.","chicago":"Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” <i>Discrete Mathematics</i> 188 (1997): 193–97.","mla":"Brinkmann, Gunnar, and Eckhard Steffen. “3- and 4-Critical Graphs of Small Even Order.” <i>Discrete Mathematics</i>, vol. 188, 1997, pp. 193–97.","ama":"Brinkmann G, Steffen E. 3- and 4-critical graphs of small even order. <i>Discrete Mathematics</i>. 1997;188:193-197.","bibtex":"@article{Brinkmann_Steffen_1997, title={3- and 4-critical graphs of small even order}, volume={188}, journal={Discrete Mathematics}, author={Brinkmann, Gunnar and Steffen, Eckhard}, year={1997}, pages={193–197} }"},"publication":"Discrete Mathematics"}]