[{"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        35","title":"Intersecting 1-factors and nowhere-zero 5-flows","year":"2015","status":"public","author":[{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"user_id":"15540","volume":35,"page":"633-640","_id":"10162","language":[{"iso":"eng"}],"publication":"Combinatorica","citation":{"short":"E. Steffen, Combinatorica 35 (2015) 633–640.","chicago":"Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” <i>Combinatorica</i> 35 (2015): 633–40.","apa":"Steffen, E. (2015). Intersecting 1-factors and nowhere-zero 5-flows. <i>Combinatorica</i>, <i>35</i>, 633–640.","ieee":"E. Steffen, “Intersecting 1-factors and nowhere-zero 5-flows,” <i>Combinatorica</i>, vol. 35, pp. 633–640, 2015.","ama":"Steffen E. Intersecting 1-factors and nowhere-zero 5-flows. <i>Combinatorica</i>. 2015;35:633-640.","bibtex":"@article{Steffen_2015, title={Intersecting 1-factors and nowhere-zero 5-flows}, volume={35}, journal={Combinatorica}, author={Steffen, Eckhard}, year={2015}, pages={633–640} }","mla":"Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” <i>Combinatorica</i>, vol. 35, 2015, pp. 633–40."},"type":"journal_article","date_created":"2019-06-07T10:09:46Z"},{"volume":79,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10163","page":"1-7","intvolume":"        79","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"year":"2015","status":"public","title":"Edge-colorings and circular flow numbers of regular graphs","type":"journal_article","date_created":"2019-06-07T10:13:36Z","citation":{"apa":"Steffen, E. (2015). Edge-colorings and circular flow numbers of regular graphs. <i>J. Graph Theory</i>, <i>79</i>, 1–7.","ieee":"E. Steffen, “Edge-colorings and circular flow numbers of regular graphs,” <i>J. Graph Theory</i>, vol. 79, pp. 1–7, 2015.","chicago":"Steffen, Eckhard. “Edge-Colorings and Circular Flow Numbers of Regular Graphs.” <i>J. Graph Theory</i> 79 (2015): 1–7.","short":"E. Steffen, J. Graph Theory 79 (2015) 1–7.","mla":"Steffen, Eckhard. “Edge-Colorings and Circular Flow Numbers of Regular Graphs.” <i>J. Graph Theory</i>, vol. 79, 2015, pp. 1–7.","ama":"Steffen E. Edge-colorings and circular flow numbers of regular graphs. <i>J Graph Theory</i>. 2015;79:1-7.","bibtex":"@article{Steffen_2015, title={Edge-colorings and circular flow numbers of regular graphs}, volume={79}, journal={J. Graph Theory}, author={Steffen, Eckhard}, year={2015}, pages={1–7} }"},"publication":"J. Graph Theory"},{"date_created":"2019-06-07T10:15:45Z","type":"journal_article","citation":{"ieee":"E. Máčajová and E. Steffen, “The difference between the circular and the integer flow number of bidirected graphs,” <i>Discrete Mathematics</i>, vol. 338, pp. 866–867, 2015.","apa":"Máčajová, E., &#38; Steffen, E. (2015). The difference between the circular and the integer flow number of bidirected graphs. <i>Discrete Mathematics</i>, <i>338</i>, 866–867.","chicago":"Máčajová, Edita, and Eckhard Steffen. “The Difference between the Circular and the Integer Flow Number of Bidirected Graphs.” <i>Discrete Mathematics</i> 338 (2015): 866–67.","short":"E. Máčajová, E. Steffen, Discrete Mathematics 338 (2015) 866–867.","mla":"Máčajová, Edita, and Eckhard Steffen. “The Difference between the Circular and the Integer Flow Number of Bidirected Graphs.” <i>Discrete Mathematics</i>, vol. 338, 2015, pp. 866–67.","bibtex":"@article{Máčajová_Steffen_2015, title={The difference between the circular and the integer flow number of bidirected graphs}, volume={338}, journal={Discrete Mathematics}, author={Máčajová, Edita and Steffen, Eckhard}, year={2015}, pages={866–867} }","ama":"Máčajová E, Steffen E. The difference between the circular and the integer flow number of bidirected graphs. <i>Discrete Mathematics</i>. 2015;338:866-867."},"publication":"Discrete Mathematics","_id":"10164","language":[{"iso":"eng"}],"page":"866-867","volume":338,"user_id":"15540","author":[{"full_name":"Máčajová, Edita","last_name":"Máčajová","first_name":"Edita"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"year":"2015","title":"The difference between the circular and the integer flow number of bidirected graphs","status":"public","intvolume":"       338","date_updated":"2022-01-06T06:50:31Z","publication_status":"published"},{"date_created":"2019-06-07T10:16:54Z","type":"journal_article","issue":"3","publication":"J. Graph Theory","citation":{"bibtex":"@article{Steffen_2015, title={1-factor-and cycle covers of cubic graphs}, volume={78}, number={3}, journal={J. Graph Theory}, author={Steffen, Eckhard}, year={2015}, pages={195 – 206} }","ama":"Steffen E. 1-factor-and cycle covers of cubic graphs. <i>J Graph Theory</i>. 2015;78(3):195 – 206.","mla":"Steffen, Eckhard. “1-Factor-and Cycle Covers of Cubic Graphs.” <i>J. Graph Theory</i>, vol. 78, no. 3, 2015, pp. 195 – 206.","short":"E. Steffen, J. Graph Theory 78 (2015) 195 – 206.","chicago":"Steffen, Eckhard. “1-Factor-and Cycle Covers of Cubic Graphs.” <i>J. Graph Theory</i> 78, no. 3 (2015): 195 – 206.","ieee":"E. Steffen, “1-factor-and cycle covers of cubic graphs,” <i>J. Graph Theory</i>, vol. 78, no. 3, pp. 195 – 206, 2015.","apa":"Steffen, E. (2015). 1-factor-and cycle covers of cubic graphs. <i>J. Graph Theory</i>, <i>78</i>(3), 195 – 206."},"page":"195 – 206","_id":"10165","language":[{"iso":"eng"}],"user_id":"15540","volume":78,"status":"public","year":"2015","title":"1-factor-and cycle covers of cubic graphs","author":[{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        78"},{"author":[{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"title":"Nowhere-zero flows on signed regular graphs","status":"public","year":"2015","intvolume":"        48","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","_id":"10166","language":[{"iso":"eng"}],"page":"34-47","volume":48,"user_id":"15540","citation":{"short":"M. Schubert, E. Steffen, European J. Combinatorics 48 (2015) 34–47.","chicago":"Schubert, Michael, and Eckhard Steffen. “Nowhere-Zero Flows on Signed Regular Graphs.” <i>European J. Combinatorics</i> 48 (2015): 34–47.","ieee":"M. Schubert and E. Steffen, “Nowhere-zero flows on signed regular graphs,” <i>European J. Combinatorics</i>, vol. 48, pp. 34–47, 2015.","apa":"Schubert, M., &#38; Steffen, E. (2015). Nowhere-zero flows on signed regular graphs. <i>European J. Combinatorics</i>, <i>48</i>, 34–47.","bibtex":"@article{Schubert_Steffen_2015, title={Nowhere-zero flows on signed regular graphs}, volume={48}, journal={European J. Combinatorics}, author={Schubert, Michael and Steffen, Eckhard}, year={2015}, pages={34–47} }","ama":"Schubert M, Steffen E. Nowhere-zero flows on signed regular graphs. <i>European J Combinatorics</i>. 2015;48:34-47.","mla":"Schubert, Michael, and Eckhard Steffen. “Nowhere-Zero Flows on Signed Regular Graphs.” <i>European J. Combinatorics</i>, vol. 48, 2015, pp. 34–47."},"publication":"European J. Combinatorics","date_created":"2019-06-07T10:18:11Z","type":"journal_article"},{"publication":"J. Graph Theory","citation":{"apa":"Schubert, M., &#38; Steffen, E. (2014). The set of circular flow numbers of regular graphs. <i>J. Graph Theory</i>, <i>76</i>, 297–308.","ieee":"M. Schubert and E. Steffen, “The set of circular flow numbers of regular graphs,” <i>J. Graph Theory</i>, vol. 76, pp. 297–308, 2014.","short":"M. Schubert, E. Steffen, J. Graph Theory 76 (2014) 297–308.","chicago":"Schubert, Michael, and Eckhard Steffen. “The Set of Circular Flow Numbers of Regular Graphs.” <i>J. Graph Theory</i> 76 (2014): 297–308.","mla":"Schubert, Michael, and Eckhard Steffen. “The Set of Circular Flow Numbers of Regular Graphs.” <i>J. Graph Theory</i>, vol. 76, 2014, pp. 297–308.","ama":"Schubert M, Steffen E. The set of circular flow numbers of regular graphs. <i>J Graph Theory</i>. 2014;76:297-308.","bibtex":"@article{Schubert_Steffen_2014, title={The set of circular flow numbers of regular graphs}, volume={76}, journal={J. Graph Theory}, author={Schubert, Michael and Steffen, Eckhard}, year={2014}, pages={297–308} }"},"type":"journal_article","date_created":"2019-06-07T10:21:17Z","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        76","title":"The set of circular flow numbers of regular graphs","status":"public","year":"2014","author":[{"first_name":"Michael","last_name":"Schubert","full_name":"Schubert, Michael"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"user_id":"15540","volume":76,"page":"297-308","_id":"10167","language":[{"iso":"eng"}]},{"type":"journal_article","date_created":"2019-06-07T11:27:56Z","citation":{"ieee":"J. Hägglund and E. Steffen, “Petersen colorings and some families of snarks,” <i>Ars Mathematica Contemporanea</i>, vol. 312, pp. 476–478, 2014.","apa":"Hägglund, J., &#38; Steffen, E. (2014). Petersen colorings and some families of snarks. <i>Ars Mathematica Contemporanea</i>, <i>312</i>, 476–478.","short":"J. Hägglund, E. Steffen, Ars Mathematica Contemporanea 312 (2014) 476–478.","chicago":"Hägglund, Jonas, and Eckhard Steffen. “Petersen Colorings and Some Families of Snarks.” <i>Ars Mathematica Contemporanea</i> 312 (2014): 476–78.","mla":"Hägglund, Jonas, and Eckhard Steffen. “Petersen Colorings and Some Families of Snarks.” <i>Ars Mathematica Contemporanea</i>, vol. 312, 2014, pp. 476–78.","bibtex":"@article{Hägglund_Steffen_2014, title={Petersen colorings and some families of snarks}, volume={312}, journal={Ars Mathematica Contemporanea}, author={Hägglund, Jonas and Steffen, Eckhard}, year={2014}, pages={476–478} }","ama":"Hägglund J, Steffen E. Petersen colorings and some families of snarks. <i>Ars Mathematica Contemporanea</i>. 2014;312:476-478."},"publication":"Ars Mathematica Contemporanea","volume":312,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10169","page":"476-478","intvolume":"       312","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","author":[{"full_name":"Hägglund, Jonas","first_name":"Jonas","last_name":"Hägglund"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"title":"Petersen colorings and some families of snarks","status":"public","year":"2014"},{"page":"159-174","language":[{"iso":"eng"}],"_id":"10170","user_id":"15540","volume":"14.1","status":"public","title":"α-labelings and the structure of trees with nonzero α-deficit ","year":"2012","author":[{"last_name":"Brinkmann","first_name":"Gunnar","full_name":"Brinkmann, Gunnar"},{"first_name":" Simon","last_name":"Crevals","full_name":"Crevals,  Simon"},{"last_name":"Melot","first_name":"Hadrien","full_name":"Melot, Hadrien"},{"full_name":"Rylands,  Leanne J.","last_name":"Rylands","first_name":" Leanne J."},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","date_created":"2019-06-07T11:34:36Z","type":"journal_article","publication":"Discrete Mathematics. and Theoretical Computer Science","citation":{"mla":"Brinkmann, Gunnar, et al. “α-Labelings and the Structure of Trees with Nonzero α-Deficit .” <i>Discrete Mathematics. and Theoretical Computer Science</i>, vol. 14.1, 2012, pp. 159–74.","ama":"Brinkmann G, Crevals  Simon, Melot H, Rylands  Leanne J., Steffen E. α-labelings and the structure of trees with nonzero α-deficit . <i>Discrete Mathematics and Theoretical Computer Science</i>. 2012;14.1:159-174.","bibtex":"@article{Brinkmann_Crevals_Melot_Rylands_Steffen_2012, title={α-labelings and the structure of trees with nonzero α-deficit }, volume={14.1}, journal={Discrete Mathematics. and Theoretical Computer Science}, author={Brinkmann, Gunnar and Crevals,  Simon and Melot, Hadrien and Rylands,  Leanne J. and Steffen, Eckhard}, year={2012}, pages={159–174} }","apa":"Brinkmann, G., Crevals,  Simon, Melot, H., Rylands,  Leanne J., &#38; Steffen, E. (2012). α-labelings and the structure of trees with nonzero α-deficit . <i>Discrete Mathematics. and Theoretical Computer Science</i>, <i>14.1</i>, 159–174.","ieee":"G. Brinkmann,  Simon Crevals, H. Melot,  Leanne J. Rylands, and E. Steffen, “α-labelings and the structure of trees with nonzero α-deficit ,” <i>Discrete Mathematics. and Theoretical Computer Science</i>, vol. 14.1, pp. 159–174, 2012.","short":"G. Brinkmann,  Simon Crevals, H. Melot,  Leanne J. Rylands, E. Steffen, Discrete Mathematics. and Theoretical Computer Science 14.1 (2012) 159–174.","chicago":"Brinkmann, Gunnar,  Simon Crevals, Hadrien Melot,  Leanne J. Rylands, and Eckhard Steffen. “α-Labelings and the Structure of Trees with Nonzero α-Deficit .” <i>Discrete Mathematics. and Theoretical Computer Science</i> 14.1 (2012): 159–74."}},{"type":"journal_article","department":[{"_id":"542"}],"date_created":"2019-06-07T11:37:11Z","publication":"Discrete Mathematics","citation":{"bibtex":"@article{Steffen_2012, title={Nearly nowhere-zero r-flow graphs}, volume={312}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2012}, pages={2757–2759} }","ama":"Steffen E. Nearly nowhere-zero r-flow graphs. <i>Discrete Mathematics</i>. 2012;312:2757-2759.","mla":"Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” <i>Discrete Mathematics</i>, vol. 312, 2012, pp. 2757–59.","short":"E. Steffen, Discrete Mathematics 312 (2012) 2757–2759.","chicago":"Steffen, Eckhard. “Nearly Nowhere-Zero r-Flow Graphs.” <i>Discrete Mathematics</i> 312 (2012): 2757–59.","ieee":"E. Steffen, “Nearly nowhere-zero r-flow graphs,” <i>Discrete Mathematics</i>, vol. 312, pp. 2757–2759, 2012.","apa":"Steffen, E. (2012). Nearly nowhere-zero r-flow graphs. <i>Discrete Mathematics</i>, <i>312</i>, 2757–2759."},"user_id":"15540","volume":312,"page":"2757-2759","_id":"10171","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       312","status":"public","title":"Nearly nowhere-zero r-flow graphs","year":"2012","author":[{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}]},{"language":[{"iso":"eng"}],"_id":"10172","page":"473-482","volume":70,"user_id":"15540","author":[{"first_name":"Vahan","last_name":"Mkrtchyan","full_name":"Mkrtchyan, Vahan"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"year":"2012","title":"Maximum Δ-edge-colorable subgraphs of class II graphs","status":"public","intvolume":"        70","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T11:38:34Z","type":"journal_article","citation":{"short":"V. Mkrtchyan, E. Steffen, J. Graph Theory 70 (2012) 473–482.","chicago":"Mkrtchyan, Vahan, and Eckhard Steffen. “Maximum Δ-Edge-Colorable Subgraphs of Class II Graphs.” <i>J. Graph Theory</i> 70 (2012): 473–82.","apa":"Mkrtchyan, V., &#38; Steffen, E. (2012). Maximum Δ-edge-colorable subgraphs of class II graphs. <i>J. Graph Theory</i>, <i>70</i>, 473–482.","ieee":"V. Mkrtchyan and E. Steffen, “Maximum Δ-edge-colorable subgraphs of class II graphs,” <i>J. Graph Theory</i>, vol. 70, pp. 473–482, 2012.","ama":"Mkrtchyan V, Steffen E. Maximum Δ-edge-colorable subgraphs of class II graphs. <i>J Graph Theory</i>. 2012;70:473-482.","bibtex":"@article{Mkrtchyan_Steffen_2012, title={Maximum Δ-edge-colorable subgraphs of class II graphs}, volume={70}, journal={J. Graph Theory}, author={Mkrtchyan, Vahan and Steffen, Eckhard}, year={2012}, pages={473–482} }","mla":"Mkrtchyan, Vahan, and Eckhard Steffen. “Maximum Δ-Edge-Colorable Subgraphs of Class II Graphs.” <i>J. Graph Theory</i>, vol. 70, 2012, pp. 473–82."},"publication":"J. Graph Theory"},{"type":"journal_article","date_created":"2019-06-07T11:40:04Z","citation":{"mla":"Mkrtchyan, Vahan, and Eckhard Steffen. “Measures of Edge-Uncolorability.” <i>Discrete Mathematics</i>, vol. 312, 2012, pp. 476–78.","bibtex":"@article{Mkrtchyan_Steffen_2012, title={Measures of edge-uncolorability}, volume={312}, journal={Discrete Mathematics}, author={Mkrtchyan, Vahan and Steffen, Eckhard}, year={2012}, pages={476–478} }","ama":"Mkrtchyan V, Steffen E. Measures of edge-uncolorability. <i>Discrete Mathematics</i>. 2012;312:476-478.","ieee":"V. Mkrtchyan and E. Steffen, “Measures of edge-uncolorability,” <i>Discrete Mathematics</i>, vol. 312, pp. 476–478, 2012.","apa":"Mkrtchyan, V., &#38; Steffen, E. (2012). Measures of edge-uncolorability. <i>Discrete Mathematics</i>, <i>312</i>, 476–478.","chicago":"Mkrtchyan, Vahan, and Eckhard Steffen. “Measures of Edge-Uncolorability.” <i>Discrete Mathematics</i> 312 (2012): 476–78.","short":"V. Mkrtchyan, E. Steffen, Discrete Mathematics 312 (2012) 476–478."},"publication":"Discrete Mathematics","volume":312,"user_id":"15540","_id":"10173","language":[{"iso":"eng"}],"page":"476-478","intvolume":"       312","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","author":[{"full_name":"Mkrtchyan, Vahan","first_name":"Vahan","last_name":"Mkrtchyan"},{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"title":"Measures of edge-uncolorability","year":"2012","status":"public"},{"user_id":"15540","volume":310,"page":"385 - 389","language":[{"iso":"eng"}],"_id":"10174","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       310","status":"public","year":"2010","title":"Tutte's 5-flow conjecture for cyclically highly connected cubic graphs","author":[{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"type":"journal_article","date_created":"2019-06-07T11:53:30Z","publication":"Discrete Mathematics","citation":{"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.","chicago":"Steffen, Eckhard. “Tutte’s 5-Flow Conjecture for Cyclically Highly Connected Cubic Graphs.” <i>Discrete Mathematics</i> 310 (2010): 385–89.","short":"E. Steffen, Discrete Mathematics 310 (2010) 385–389.","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."}},{"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."}],"publication":"arXiv:1003.5782","citation":{"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).","ieee":"V. Mkrtchyan and E. Steffen, “Bricks and conjectures of Berge, Fulkerson and Seymour,” <i>arXiv:1003.5782</i>. 2010.","apa":"Mkrtchyan, V., &#38; Steffen, E. (2010). Bricks and conjectures of Berge, Fulkerson and Seymour. <i>ArXiv:1003.5782</i>.","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} }","ama":"Mkrtchyan V, Steffen E. Bricks and conjectures of Berge, Fulkerson and Seymour. <i>arXiv:10035782</i>. 2010.","mla":"Mkrtchyan, Vahan, and Eckhard Steffen. “Bricks and Conjectures of Berge, Fulkerson and Seymour.” <i>ArXiv:1003.5782</i>, 2010."},"type":"preprint","date_created":"2019-06-07T13:10:04Z","date_updated":"2022-01-06T06:50:31Z","status":"public","title":"Bricks and conjectures of Berge, Fulkerson and Seymour","year":"2010","author":[{"full_name":"Mkrtchyan, Vahan","first_name":"Vahan","last_name":"Mkrtchyan"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"user_id":"15540","_id":"10202","language":[{"iso":"eng"}]},{"publication":"Ars Mathematica Contemporanea","citation":{"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.","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.","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.","mla":"Mohar, Bojan, et al. “Relating Embedding and Coloring Properties of Snarks.” <i>Ars Mathematica Contemporanea</i>, vol. 1, 2008, pp. 169–84."},"type":"journal_article","date_created":"2019-06-07T11:55:12Z","date_updated":"2022-01-06T06:50:31Z","intvolume":"         1","title":"Relating embedding and coloring properties of snarks","status":"public","year":"2008","author":[{"last_name":"Mohar","first_name":"Bojan","full_name":"Mohar, Bojan"},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"},{"full_name":"Vodopivec, Andrej","last_name":"Vodopivec","first_name":"Andrej"}],"user_id":"15540","volume":1,"page":"169-184","_id":"10175","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"10176","page":"1645 -1646","volume":154,"user_id":"15540","author":[{"full_name":"Boben, Marco","first_name":"Marco","last_name":"Boben"},{"last_name":"Pisanski","first_name":"Tomaž ","full_name":"Pisanski, Tomaž "},{"full_name":"Ravnik, Natasa","last_name":"Ravnik","first_name":"Natasa"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"year":"2006","status":"public","title":"Erratum to „Reductions of Symmetry configurations n3","intvolume":"       154","date_updated":"2022-01-06T06:50:31Z","publication_status":"published","date_created":"2019-06-07T12:03:43Z","type":"journal_article","citation":{"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.","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} }","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.","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.","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.","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."},"publication":"Discrete Applied Mathematics","issue":"11"},{"user_id":"15540","volume":280,"page":"191 - 214","_id":"10177","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"       280","year":"2004","title":"Measurements of edge-uncolorability","status":"public","author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"type":"journal_article","date_created":"2019-06-07T12:07:05Z","publication":"Discrete Mathematics","citation":{"ieee":"E. Steffen, “Measurements of edge-uncolorability,” <i>Discrete Mathematics</i>, vol. 280, pp. 191–214, 2004.","apa":"Steffen, E. (2004). Measurements of edge-uncolorability. <i>Discrete Mathematics</i>, <i>280</i>, 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.","mla":"Steffen, Eckhard. “Measurements of Edge-Uncolorability.” <i>Discrete Mathematics</i>, vol. 280, 2004, pp. 191–214.","bibtex":"@article{Steffen_2004, title={Measurements of edge-uncolorability}, volume={280}, journal={Discrete Mathematics}, author={Steffen, Eckhard}, year={2004}, pages={191–214} }","ama":"Steffen E. Measurements of edge-uncolorability. <i>Discrete Mathematics</i>. 2004;280:191-214."}},{"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        45","title":"Independent Sets and 2-factors in edge-chromatic critical graphs","year":"2004","status":"public","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"}],"user_id":"15540","volume":45,"page":"113 -118","language":[{"iso":"eng"}],"_id":"10178","publication":"J. Graph Theory","citation":{"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} }","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.","short":"S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.","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.","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."},"type":"journal_article","date_created":"2019-06-07T12:08:31Z"},{"publication":"J. Graph Theory","citation":{"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} }","ama":"Steffen E. Circular flow numbers of regular multigraphs. <i>J Graph Theory</i>. 2001;36: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.","ieee":"E. Steffen, “Circular flow numbers of regular multigraphs,” <i>J. Graph Theory</i>, vol. 36, pp. 24–34, 2001.","apa":"Steffen, E. (2001). Circular flow numbers of regular multigraphs. <i>J. Graph Theory</i>, <i>36</i>, 24–34."},"date_created":"2019-06-07T12:09:37Z","type":"journal_article","title":"Circular flow numbers of regular multigraphs","year":"2001","status":"public","author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        36","page":"24 - 34","_id":"10179","language":[{"iso":"eng"}],"user_id":"15540","volume":36},{"date_created":"2019-06-07T12:24:44Z","type":"journal_article","citation":{"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.","chicago":"Steffen, Eckhard. “On Bicritical Snarks.” <i>Math. Slovaca</i> 51 (2001): 141–50.","short":"E. Steffen, Math. Slovaca 51 (2001) 141–150.","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} }"},"publication":"Math. Slovaca","language":[{"iso":"eng"}],"_id":"10180","page":"141 -150","volume":51,"user_id":"15540","author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"year":"2001","title":"On bicritical snarks","status":"public","intvolume":"        51","date_updated":"2022-01-06T06:50:31Z","publication_status":"published"},{"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.","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.","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.","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} }","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.","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.","type":"journal_article","date_created":"2019-06-07T12:29:36Z","intvolume":"        32","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"Gunnar","last_name":"Brinkmann","full_name":"Brinkmann, Gunnar"},{"full_name":"Choudum, Sheshayya A","last_name":"Choudum","first_name":"Sheshayya A"},{"full_name":"Grünewald, Stefan","first_name":"Stefan","last_name":"Grünewald"},{"id":"15548","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"year":"2000","title":"Bounds for the independence number of critical graphs","status":"public","volume":32,"user_id":"15540","language":[{"iso":"eng"}],"_id":"10182","page":"137 -140"}]