[{"type":"journal_article","keyword":["Discrete Mathematics and Combinatorics"],"department":[{"_id":"542"}],"date_created":"2022-08-15T09:35:02Z","publication":"European Journal of Combinatorics","doi":"10.1016/j.ejc.2021.103451","article_number":"103451","language":[{"iso":"eng"}],"date_updated":"2022-08-15T09:35:32Z","publication_status":"published","intvolume":"       100","title":"On 3-flow-critical graphs","year":"2021","publication_identifier":{"issn":["0195-6698"]},"author":[{"first_name":"Jiaao","last_name":"Li","full_name":"Li, Jiaao"},{"last_name":"Ma","first_name":"Yulai","full_name":"Ma, Yulai","id":"92748"},{"last_name":"Shi","first_name":"Yongtang","full_name":"Shi, Yongtang"},{"first_name":"Weifan","last_name":"Wang","full_name":"Wang, Weifan"},{"first_name":"Yezhou","last_name":"Wu","full_name":"Wu, Yezhou"}],"citation":{"ieee":"J. Li, Y. Ma, Y. Shi, W. Wang, and Y. Wu, “On 3-flow-critical graphs,” <i>European Journal of Combinatorics</i>, vol. 100, Art. no. 103451, 2021, doi: <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>.","apa":"Li, J., Ma, Y., Shi, Y., Wang, W., &#38; Wu, Y. (2021). On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>, <i>100</i>, Article 103451. <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>","short":"J. Li, Y. Ma, Y. Shi, W. Wang, Y. Wu, European Journal of Combinatorics 100 (2021).","chicago":"Li, Jiaao, Yulai Ma, Yongtang Shi, Weifan Wang, and Yezhou Wu. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i> 100 (2021). <a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">https://doi.org/10.1016/j.ejc.2021.103451</a>.","mla":"Li, Jiaao, et al. “On 3-Flow-Critical Graphs.” <i>European Journal of Combinatorics</i>, vol. 100, 103451, Elsevier BV, 2021, doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>.","bibtex":"@article{Li_Ma_Shi_Wang_Wu_2021, title={On 3-flow-critical graphs}, volume={100}, DOI={<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>}, number={103451}, journal={European Journal of Combinatorics}, publisher={Elsevier BV}, author={Li, Jiaao and Ma, Yulai and Shi, Yongtang and Wang, Weifan and Wu, Yezhou}, year={2021} }","ama":"Li J, Ma Y, Shi Y, Wang W, Wu Y. On 3-flow-critical graphs. <i>European Journal of Combinatorics</i>. 2021;100. doi:<a href=\"https://doi.org/10.1016/j.ejc.2021.103451\">10.1016/j.ejc.2021.103451</a>"},"user_id":"15540","volume":100,"publisher":"Elsevier BV","_id":"32810","status":"public"},{"keyword":["factorization","perfect matchings","regular graphs","r-graphs"],"type":"journal_article","date_created":"2021-08-19T12:45:45Z","issue":"1","publication":"Journal of Graph Theory","doi":"10.1002/jgt.22729","language":[{"iso":"eng"}],"date_updated":"2023-05-16T10:39:20Z","publication_status":"published","intvolume":"        99","article_type":"original","title":"Highly edge‐connected regular graphs without large factorizable subgraphs","year":"2021","author":[{"last_name":"Mattiolo","first_name":"Davide","full_name":"Mattiolo, Davide"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard"}],"publication_identifier":{"issn":["0364-9024","1097-0118"]},"external_id":{"arxiv":["1912.09704"]},"citation":{"short":"D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.","chicago":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i> 99, no. 1 (2021): 107–16. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>.","apa":"Mattiolo, D., &#38; Steffen, E. (2021). Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>, <i>99</i>(1), 107–116. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>","ieee":"D. Mattiolo and E. Steffen, “Highly edge‐connected regular graphs without large factorizable subgraphs,” <i>Journal of Graph Theory</i>, vol. 99, no. 1, pp. 107–116, 2021, doi: <a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>.","ama":"Mattiolo D, Steffen E. Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>. 2021;99(1):107-116. doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>","bibtex":"@article{Mattiolo_Steffen_2021, title={Highly edge‐connected regular graphs without large factorizable subgraphs}, volume={99}, DOI={<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>}, number={1}, journal={Journal of Graph Theory}, author={Mattiolo, Davide and Steffen, Eckhard}, year={2021}, pages={107–116} }","mla":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i>, vol. 99, no. 1, 2021, pp. 107–16, doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>."},"user_id":"15540","volume":99,"page":"107-116","_id":"23456","status":"public"},{"date_updated":"2023-05-16T10:45:10Z","publication_status":"published","publication_identifier":{"issn":["0911-0119","1435-5914"]},"author":[{"first_name":"Antje","last_name":"Klopp","full_name":"Klopp, Antje"},{"id":"15548","full_name":"Steffen, Eckhard","orcid":"0000-0002-9808-7401","first_name":"Eckhard","last_name":"Steffen"}],"status":"public","year":"2021","title":"Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs","doi":"10.1007/s00373-020-02266-6","user_id":"15540","language":[{"iso":"eng"}],"_id":"21827","page":"559-580","citation":{"ama":"Klopp A, Steffen E. Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. <i>Graphs and Combinatorics</i>. Published online 2021:559-580. doi:<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>","bibtex":"@article{Klopp_Steffen_2021, title={Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs}, DOI={<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>}, journal={Graphs and Combinatorics}, author={Klopp, Antje and Steffen, Eckhard}, year={2021}, pages={559–580} }","mla":"Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.” <i>Graphs and Combinatorics</i>, 2021, pp. 559–80, doi:<a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>.","chicago":"Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.” <i>Graphs and Combinatorics</i>, 2021, 559–80. <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">https://doi.org/10.1007/s00373-020-02266-6</a>.","short":"A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.","apa":"Klopp, A., &#38; Steffen, E. (2021). Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. <i>Graphs and Combinatorics</i>, 559–580. <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">https://doi.org/10.1007/s00373-020-02266-6</a>","ieee":"A. Klopp and E. Steffen, “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs,” <i>Graphs and Combinatorics</i>, pp. 559–580, 2021, doi: <a href=\"https://doi.org/10.1007/s00373-020-02266-6\">10.1007/s00373-020-02266-6</a>."},"publication":"Graphs and Combinatorics","type":"journal_article","date_created":"2021-04-30T07:22:24Z","external_id":{"arxiv":["1903.12385"]}},{"language":[{"iso":"eng"}],"_id":"13445","user_id":"15540","volume":91,"title":"Concepts of signed graph coloring","status":"public","year":"2021","author":[{"full_name":"Steffen, Eckhard","first_name":"Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen","id":"15548"},{"full_name":"Vogel, Alexander","last_name":"Vogel","first_name":"Alexander"}],"date_updated":"2023-05-16T10:46:55Z","intvolume":"        91","external_id":{"arxiv":["1909.09381"]},"date_created":"2019-09-24T14:19:42Z","type":"journal_article","publication":"European J. Combinatorics","citation":{"ama":"Steffen E, Vogel A. Concepts of signed graph coloring. <i>European J Combinatorics</i>. 2021;91.","bibtex":"@article{Steffen_Vogel_2021, title={Concepts of signed graph coloring}, volume={91}, journal={European J. Combinatorics}, author={Steffen, Eckhard and Vogel, Alexander}, year={2021} }","mla":"Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.” <i>European J. Combinatorics</i>, vol. 91, 2021.","chicago":"Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.” <i>European J. Combinatorics</i> 91 (2021).","short":"E. Steffen, A. Vogel, European J. Combinatorics 91 (2021).","apa":"Steffen, E., &#38; Vogel, A. (2021). Concepts of signed graph coloring. <i>European J. Combinatorics</i>, <i>91</i>.","ieee":"E. Steffen and A. Vogel, “Concepts of signed graph coloring,” <i>European J. Combinatorics</i>, vol. 91, 2021."}},{"external_id":{"arxiv":["1908.11004"]},"date_created":"2019-08-30T12:37:18Z","type":"journal_article","publication":"SIAM J. Discrete Math","citation":{"short":"Y. Lu, R. Luo, M. Schubert, E. Steffen, C.-Q. Zhang, SIAM J. Discrete Math 34 (4) (2020) 2166–2187.","chicago":"Lu, You, Rong Luo, Michael Schubert, Eckhard Steffen, and Cun-Quan Zhang. “Flows on Signed Graphs without Long Barbells.” <i>SIAM J. Discrete Math</i> 34 (4) (2020): 2166–87. <a href=\"https://doi.org/10.1137/18M1222818\">https://doi.org/10.1137/18M1222818</a>.","ieee":"Y. Lu, R. Luo, M. Schubert, E. Steffen, and C.-Q. Zhang, “Flows on signed graphs without long barbells,” <i>SIAM J. Discrete Math</i>, vol. 34 (4), pp. 2166–2187, 2020, doi: <a href=\"https://doi.org/10.1137/18M1222818\">10.1137/18M1222818</a>.","apa":"Lu, Y., Luo, R., Schubert, M., Steffen, E., &#38; Zhang, C.-Q. (2020). Flows on signed graphs without long barbells. <i>SIAM J. Discrete Math</i>, <i>34 (4)</i>, 2166–2187. <a href=\"https://doi.org/10.1137/18M1222818\">https://doi.org/10.1137/18M1222818</a>","bibtex":"@article{Lu_Luo_Schubert_Steffen_Zhang_2020, title={Flows on signed graphs without long barbells}, volume={34 (4)}, DOI={<a href=\"https://doi.org/10.1137/18M1222818\">10.1137/18M1222818</a>}, journal={SIAM J. Discrete Math}, author={Lu, You and Luo, Rong and Schubert, Michael and Steffen, Eckhard and Zhang, Cun-Quan}, year={2020}, pages={2166–2187} }","ama":"Lu Y, Luo R, Schubert M, Steffen E, Zhang C-Q. Flows on signed graphs without long barbells. <i>SIAM J Discrete Math</i>. 2020;34 (4):2166-2187. doi:<a href=\"https://doi.org/10.1137/18M1222818\">10.1137/18M1222818</a>","mla":"Lu, You, et al. “Flows on Signed Graphs without Long Barbells.” <i>SIAM J. Discrete Math</i>, vol. 34 (4), 2020, pp. 2166–87, doi:<a href=\"https://doi.org/10.1137/18M1222818\">10.1137/18M1222818</a>."},"page":"2166-2187","_id":"13114","language":[{"iso":"eng"}],"user_id":"15540","doi":"10.1137/18M1222818","volume":"34 (4)","status":"public","title":"Flows on signed graphs without long barbells","year":"2020","author":[{"first_name":"You","last_name":"Lu","full_name":"Lu, You"},{"full_name":"Luo, Rong","first_name":"Rong","last_name":"Luo"},{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"},{"last_name":"Steffen","orcid":"0000-0002-9808-7401","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"},{"full_name":"Zhang, Cun-Quan","first_name":"Cun-Quan","last_name":"Zhang"}],"date_updated":"2023-05-16T10:43:39Z"},{"publication":"J. of Combinatorics","citation":{"chicago":"Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” <i>J. of Combinatorics</i> 11 (2020): 457–73.","short":"L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.","apa":"Jin, L., &#38; Steffen, E. (2020). Unions of 1-factors in r-graphs and overfull graphs. <i>J. of Combinatorics</i>, <i>11</i>, 457–473.","ieee":"L. Jin and E. Steffen, “Unions of 1-factors in r-graphs and overfull graphs,” <i>J. of Combinatorics</i>, vol. 11, pp. 457–473, 2020.","ama":"Jin L, Steffen E. Unions of 1-factors in r-graphs and overfull graphs. <i>J of Combinatorics</i>. 2020;11:457-473.","bibtex":"@article{Jin_Steffen_2020, title={Unions of 1-factors in r-graphs and overfull graphs}, volume={11}, journal={J. of Combinatorics}, author={Jin, Ligang and Steffen, Eckhard}, year={2020}, pages={457–473} }","mla":"Jin, Ligang, and Eckhard Steffen. “Unions of 1-Factors in r-Graphs and Overfull Graphs.” <i>J. of Combinatorics</i>, vol. 11, 2020, pp. 457–73."},"external_id":{"arxiv":["1509.01823"]},"date_created":"2019-08-26T13:53:51Z","type":"journal_article","year":"2020","title":"Unions of 1-factors in r-graphs and overfull graphs","status":"public","author":[{"full_name":"Jin, Ligang","first_name":"Ligang","last_name":"Jin"},{"id":"15548","first_name":"Eckhard","last_name":"Steffen","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard"}],"date_updated":"2023-05-16T10:53:21Z","intvolume":"        11","page":"457-473","language":[{"iso":"eng"}],"_id":"12971","user_id":"15540","volume":11},{"date_created":"2020-05-05T15:38:22Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"66"}],"publication":"Zukunft der Arbeit – Eine praxisnahe Betrachtung","citation":{"mla":"Engels, Gregor, et al. “Gerechtigkeit in Flexiblen Arbeits- Und Managementprozessen.” <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>, edited by Steffen Wischmann and Ernst Andreas Hartmann, Springer Verlag, 2018, pp. 221–31, doi:<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>.","bibtex":"@inbook{Engels_Maier_Ötting_Steffen_Teetz_2018, place={Berlin, Heidelberg}, title={Gerechtigkeit in flexiblen Arbeits- und Managementprozessen}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>}, booktitle={Zukunft der Arbeit – Eine praxisnahe Betrachtung}, publisher={Springer Verlag}, author={Engels, Gregor and Maier, Günter W. and Ötting, Sonja K. and Steffen, Eckhard and Teetz, Alexander}, editor={Wischmann, Steffen and Hartmann, Ernst AndreasEditors}, year={2018}, pages={221–231} }","ama":"Engels G, Maier GW, Ötting SK, Steffen E, Teetz A. Gerechtigkeit in flexiblen Arbeits- und Managementprozessen. In: Wischmann S, Hartmann EA, eds. <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>. Berlin, Heidelberg: Springer Verlag; 2018:221-231. doi:<a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">10.1007/978-3-662-49266-6_16</a>","ieee":"G. Engels, G. W. Maier, S. K. Ötting, E. Steffen, and A. Teetz, “Gerechtigkeit in flexiblen Arbeits- und Managementprozessen,” in <i>Zukunft der Arbeit – Eine praxisnahe Betrachtung</i>, S. Wischmann and E. A. Hartmann, Eds. Berlin, Heidelberg: Springer Verlag, 2018, pp. 221–231.","apa":"Engels, G., Maier, G. W., Ötting, S. K., Steffen, E., &#38; Teetz, A. (2018). Gerechtigkeit in flexiblen Arbeits- und Managementprozessen. In S. Wischmann &#38; E. A. Hartmann (Eds.), <i>Zukunft der Arbeit – Eine praxisnahe Betrachtung</i> (pp. 221–231). Berlin, Heidelberg: Springer Verlag. <a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">https://doi.org/10.1007/978-3-662-49266-6_16</a>","chicago":"Engels, Gregor, Günter W. Maier, Sonja K. Ötting, Eckhard Steffen, and Alexander Teetz. “Gerechtigkeit in Flexiblen Arbeits- Und Managementprozessen.” In <i>Zukunft Der Arbeit – Eine Praxisnahe Betrachtung</i>, edited by Steffen Wischmann and Ernst Andreas Hartmann, 221–31. Berlin, Heidelberg: Springer Verlag, 2018. <a href=\"https://doi.org/10.1007/978-3-662-49266-6_16\">https://doi.org/10.1007/978-3-662-49266-6_16</a>.","short":"G. Engels, G.W. Maier, S.K. Ötting, E. Steffen, A. Teetz, in: S. Wischmann, E.A. Hartmann (Eds.), Zukunft Der Arbeit – Eine Praxisnahe Betrachtung, Springer Verlag, Berlin, Heidelberg, 2018, pp. 221–231."},"page":"221-231","_id":"16938","language":[{"iso":"eng"}],"publisher":"Springer Verlag","user_id":"57458","doi":"10.1007/978-3-662-49266-6_16","editor":[{"first_name":"Steffen","last_name":"Wischmann","full_name":"Wischmann, Steffen"},{"full_name":"Hartmann, Ernst Andreas","last_name":"Hartmann","first_name":"Ernst Andreas"}],"title":"Gerechtigkeit in flexiblen Arbeits- und Managementprozessen","year":"2018","status":"public","publication_identifier":{"isbn":["9783662492659","9783662492666"]},"author":[{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"},{"full_name":"Maier, Günter W.","first_name":"Günter W.","last_name":"Maier"},{"full_name":"Ötting, Sonja K.","last_name":"Ötting","first_name":"Sonja K."},{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"},{"first_name":"Alexander","last_name":"Teetz","full_name":"Teetz, Alexander"}],"publication_status":"published","date_updated":"2022-01-06T06:52:59Z"},{"date_created":"2019-06-05T09:59:10Z","type":"journal_article","keyword":["Cubic graph","Tait coloring","Snark","Boole coloring","Berge's conjecture","Tutte's 5-flow conjecture"],"department":[{"_id":"542"}],"issue":"4","publication":"The Electronic Journal of Combinatorics","citation":{"bibtex":"@article{Fiol_Mazzuoccolo_Steffen_2018, title={Measures of Edge-Uncolorability of Cubic Graphs}, volume={25}, number={4P4.54}, journal={The Electronic Journal of Combinatorics}, author={Fiol, M. A. and Mazzuoccolo, Guiseppe and Steffen, Eckhard}, year={2018} }","chicago":"Fiol, M. A., Guiseppe Mazzuoccolo, and Eckhard Steffen. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i> 25, no. 4 (2018).","ama":"Fiol MA, Mazzuoccolo G, Steffen E. Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>. 2018;25(4).","short":"M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).","ieee":"M. A. Fiol, G. Mazzuoccolo, and E. Steffen, “Measures of Edge-Uncolorability of Cubic Graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, 2018.","mla":"Fiol, M. A., et al. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, P4.54, 2018.","apa":"Fiol, M. A., Mazzuoccolo, G., &#38; Steffen, E. (2018). Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>, <i>25</i>(4)."},"abstract":[{"lang":"eng","text":"There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edge-colorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such  measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures."}],"article_number":"P4.54","language":[{"iso":"eng"}],"_id":"10129","user_id":"15540","volume":25,"year":"2018","title":"Measures of Edge-Uncolorability of Cubic Graphs","status":"public","author":[{"full_name":"Fiol, M. A.","first_name":"M. A.","last_name":"Fiol"},{"full_name":"Mazzuoccolo, Guiseppe","first_name":"Guiseppe","last_name":"Mazzuoccolo"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"date_updated":"2022-01-06T06:50:30Z","article_type":"original","intvolume":"        25"},{"date_updated":"2022-01-06T06:50:30Z","publication_status":"published","intvolume":"        25","status":"public","title":"Flows in Signed Graphs with Two Negative Edges ","year":"2018","author":[{"last_name":"Rollová","first_name":"Edita","full_name":"Rollová, Edita"},{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"doi":"10.37236/4458","user_id":"15540","volume":25,"article_number":"P2.40","_id":"10130","language":[{"iso":"eng"}],"issue":"2","publication":"The Electronic Journal of Combinatorics","citation":{"ieee":"E. Rollová, M. Schubert, and E. Steffen, “Flows in Signed Graphs with Two Negative Edges ,” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 2, 2018.","mla":"Rollová, Edita, et al. “Flows in Signed Graphs with Two Negative Edges .” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 2, P2.40, 2018, doi:<a href=\"https://doi.org/10.37236/4458\">10.37236/4458</a>.","apa":"Rollová, E., Schubert, M., &#38; Steffen, E. (2018). Flows in Signed Graphs with Two Negative Edges . <i>The Electronic Journal of Combinatorics</i>, <i>25</i>(2). <a href=\"https://doi.org/10.37236/4458\">https://doi.org/10.37236/4458</a>","bibtex":"@article{Rollová_Schubert_Steffen_2018, title={Flows in Signed Graphs with Two Negative Edges }, volume={25}, DOI={<a href=\"https://doi.org/10.37236/4458\">10.37236/4458</a>}, number={2P2.40}, journal={The Electronic Journal of Combinatorics}, author={Rollová, Edita and Schubert, Michael and Steffen, Eckhard}, year={2018} }","chicago":"Rollová, Edita, Michael Schubert, and Eckhard Steffen. “Flows in Signed Graphs with Two Negative Edges .” <i>The Electronic Journal of Combinatorics</i> 25, no. 2 (2018). <a href=\"https://doi.org/10.37236/4458\">https://doi.org/10.37236/4458</a>.","ama":"Rollová E, Schubert M, Steffen E. Flows in Signed Graphs with Two Negative Edges . <i>The Electronic Journal of Combinatorics</i>. 2018;25(2). doi:<a href=\"https://doi.org/10.37236/4458\">10.37236/4458</a>","short":"E. Rollová, M. Schubert, E. Steffen, The Electronic Journal of Combinatorics 25 (2018)."},"type":"journal_article","date_created":"2019-06-05T10:03:06Z"},{"volume":38,"user_id":"15540","doi":"10.7151/dmgt.1999","language":[{"iso":"eng"}],"_id":"10132","page":"165-175","intvolume":"        38","publication_status":"published","date_updated":"2022-01-06T06:50:30Z","publication_identifier":{"issn":["1234-3099","2083-5892"]},"author":[{"full_name":"Jin, Ligang","first_name":"Ligang","last_name":"Jin"},{"last_name":"Mazzuoccolo","first_name":"Giuseppe","full_name":"Mazzuoccolo, Giuseppe"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"year":"2018","title":"Cores, joins  and the Fano-flow conjectures","status":"public","department":[{"_id":"542"}],"type":"journal_article","date_created":"2019-06-05T10:08:41Z","citation":{"chicago":"Jin, Ligang, Giuseppe Mazzuoccolo, and Eckhard Steffen. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i> 38 (2018): 165–75. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>.","short":"L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.","ieee":"L. Jin, G. Mazzuoccolo, and E. Steffen, “Cores, joins  and the Fano-flow conjectures,” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, pp. 165–175, 2018.","apa":"Jin, L., Mazzuoccolo, G., &#38; Steffen, E. (2018). Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>, <i>38</i>, 165–175. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>","bibtex":"@article{Jin_Mazzuoccolo_Steffen_2018, title={Cores, joins  and the Fano-flow conjectures}, volume={38}, DOI={<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>}, journal={Discussiones Mathematicae Graph Theory}, author={Jin, Ligang and Mazzuoccolo, Giuseppe and Steffen, Eckhard}, year={2018}, pages={165–175} }","ama":"Jin L, Mazzuoccolo G, Steffen E. Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>. 2018;38:165-175. doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>","mla":"Jin, Ligang, et al. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, 2018, pp. 165–75, doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>."},"publication":"Discussiones Mathematicae Graph Theory"},{"page":"153-160","_id":"10142","language":[{"iso":"eng"}],"user_id":"15540","volume":71,"year":"2018","status":"public","title":"Approximating Vizing’s independence number conjecture","author":[{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"        71","date_created":"2019-06-07T08:36:36Z","type":"journal_article","department":[{"_id":"542"}],"publication":"Australasian Journal of Combinatorics","issue":"1","citation":{"short":"E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.","chicago":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i> 71, no. 1 (2018): 153–60.","ieee":"E. Steffen, “Approximating Vizing’s independence number conjecture,” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, pp. 153–160, 2018.","apa":"Steffen, E. (2018). Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>, <i>71</i>(1), 153–160.","bibtex":"@article{Steffen_2018, title={Approximating Vizing’s independence number conjecture}, volume={71}, number={1}, journal={Australasian Journal of Combinatorics}, author={Steffen, Eckhard}, year={2018}, pages={153–160} }","ama":"Steffen E. Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>. 2018;71(1):153-160.","mla":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, 2018, pp. 153–60."}},{"date_created":"2019-06-07T08:53:13Z","type":"book_editor","citation":{"ieee":"G. W. Maier, G. Engels, and E. Steffen, Eds., <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i>, 1st ed. Springer Berlin Heidelberg, 2017.","apa":"Maier, G. W., Engels, G., &#38; Steffen, E. (Eds.). (2017). <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i> (1st ed.). Springer Berlin Heidelberg.","chicago":"Maier, Günter W., Gregor Engels, and Eckhard Steffen, eds. <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i>. 1st ed. Springer Berlin Heidelberg, 2017.","short":"G.W. Maier, G. Engels, E. Steffen, eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017.","mla":"Maier, Günter W., et al., editors. <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i>. 1st ed., Springer Berlin Heidelberg, 2017.","bibtex":"@book{Maier_Engels_Steffen_2017, edition={1}, title={Handbuch Gestaltung digitaler und vernetzter Arbeitswelten}, publisher={Springer Berlin Heidelberg}, year={2017} }","ama":"Maier GW, Engels G, Steffen E, eds. <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i>. 1st ed. Springer Berlin Heidelberg; 2017."},"_id":"10146","edition":"1","publisher":"Springer Berlin Heidelberg","language":[{"iso":"ger"}],"editor":[{"full_name":"Maier, Günter W.","first_name":"Günter W.","last_name":"Maier"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"alternative_title":["Springer Reference Psychologie"],"user_id":"15540","status":"public","year":"2017","title":"Handbuch Gestaltung digitaler und vernetzter Arbeitswelten","publication_status":"published","date_updated":"2022-01-06T06:50:31Z"},{"date_created":"2019-06-07T08:57:03Z","type":"book_chapter","department":[{"_id":"422"}],"publication":"Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,","citation":{"mla":"Simon, Dagmar, and Eckhard Steffen. “Digitale Zukunft: ein inter- und transdisziplinäres Thema.” <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,</i> edited by Günter W. Maier et al., 1st ed., Springer Berlin Heidelberg, 2017, pp. 1–12.","ama":"Simon D, Steffen E. Digitale Zukunft: ein inter- und transdisziplinäres Thema. In: Maier GW, Engels G, Steffen E, eds. <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,</i>. 1st ed. Springer Berlin Heidelberg; 2017:1-12.","bibtex":"@inbook{Simon_Steffen_2017, edition={1}, title={Digitale Zukunft: ein inter- und transdisziplinäres Thema}, booktitle={Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,}, publisher={Springer Berlin Heidelberg}, author={Simon, Dagmar and Steffen, Eckhard}, editor={Maier, Günter W. and Engels, Gregor and Steffen, EckhardEditors}, year={2017}, pages={1–12} }","apa":"Simon, D., &#38; Steffen, E. (2017). Digitale Zukunft: ein inter- und transdisziplinäres Thema. In G. W. Maier, G. Engels, &#38; E. Steffen (Eds.), <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,</i> (1st ed., pp. 1–12). Springer Berlin Heidelberg.","ieee":"D. Simon and E. Steffen, “Digitale Zukunft: ein inter- und transdisziplinäres Thema,” in <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,</i> 1st ed., G. W. Maier, G. Engels, and E. Steffen, Eds. Springer Berlin Heidelberg, 2017, pp. 1–12.","short":"D. Simon, E. Steffen, in: G.W. Maier, G. Engels, E. Steffen (Eds.), Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017, pp. 1–12.","chicago":"Simon, Dagmar, and Eckhard Steffen. “Digitale Zukunft: ein inter- und transdisziplinäres Thema.” In <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,</i> edited by Günter W. Maier, Gregor Engels, and Eckhard Steffen, 1st ed., 1–12. Springer Berlin Heidelberg, 2017."},"page":"1-12","language":[{"iso":"ger"}],"_id":"10147","edition":"1","publisher":"Springer Berlin Heidelberg","user_id":"15540","editor":[{"full_name":"Maier, Günter W.","first_name":"Günter W.","last_name":"Maier"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"},{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"title":"Digitale Zukunft: ein inter- und transdisziplinäres Thema","status":"public","year":"2017","author":[{"first_name":"Dagmar","last_name":"Simon","full_name":"Simon, Dagmar"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z"},{"status":"public","title":"Nowhere-zero 5-flows on cubic graphs with oddness 4","year":"2017","author":[{"first_name":"Guiseppe","last_name":"Mazzuoccolo","full_name":"Mazzuoccolo, Guiseppe"},{"id":"15548","last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        85","page":"363 – 371 ","_id":"10155","language":[{"iso":"eng"}],"user_id":"15540","volume":85,"publication":"J. Graph Theory","citation":{"mla":"Mazzuoccolo, Guiseppe, and Eckhard Steffen. “Nowhere-Zero 5-Flows on Cubic Graphs with Oddness 4.” <i>J. Graph Theory</i>, vol. 85, 2017, pp. 363 – 371.","ama":"Mazzuoccolo G, Steffen E. Nowhere-zero 5-flows on cubic graphs with oddness 4. <i>J Graph Theory</i>. 2017;85:363 – 371.","bibtex":"@article{Mazzuoccolo_Steffen_2017, title={Nowhere-zero 5-flows on cubic graphs with oddness 4}, volume={85}, journal={J. Graph Theory}, author={Mazzuoccolo, Guiseppe and Steffen, Eckhard}, year={2017}, pages={363 – 371} }","apa":"Mazzuoccolo, G., &#38; Steffen, E. (2017). Nowhere-zero 5-flows on cubic graphs with oddness 4. <i>J. Graph Theory</i>, <i>85</i>, 363 – 371.","ieee":"G. Mazzuoccolo and E. Steffen, “Nowhere-zero 5-flows on cubic graphs with oddness 4,” <i>J. Graph Theory</i>, vol. 85, pp. 363 – 371, 2017.","chicago":"Mazzuoccolo, Guiseppe, and Eckhard Steffen. “Nowhere-Zero 5-Flows on Cubic Graphs with Oddness 4.” <i>J. Graph Theory</i> 85 (2017): 363 – 371.","short":"G. Mazzuoccolo, E. Steffen, J. Graph Theory 85 (2017) 363 – 371."},"date_created":"2019-06-07T09:50:24Z","type":"journal_article"},{"publication":"Lecture Notes of Seminario Interdisciplinare di Matematica","citation":{"mla":"Bej, Saptarshi, and Eckhard Steffen. “Factors of Edge-Chromatic Critical Graphs: A Brief Survey and Some Equivalences.” <i>Lecture Notes of Seminario Interdisciplinare Di Matematica</i>, vol. 14, 2017, pp. 37–48.","bibtex":"@article{Bej_Steffen_2017, title={Factors of edge-chromatic critical graphs: a brief survey and some equivalences}, volume={14}, journal={Lecture Notes of Seminario Interdisciplinare di Matematica}, author={Bej, Saptarshi and Steffen, Eckhard}, year={2017}, pages={37–48} }","ama":"Bej S, Steffen E. Factors of edge-chromatic critical graphs: a brief survey and some equivalences. <i>Lecture Notes of Seminario Interdisciplinare di Matematica</i>. 2017;14:37-48.","ieee":"S. Bej and E. Steffen, “Factors of edge-chromatic critical graphs: a brief survey and some equivalences,” <i>Lecture Notes of Seminario Interdisciplinare di Matematica</i>, vol. 14, pp. 37–48, 2017.","apa":"Bej, S., &#38; Steffen, E. (2017). Factors of edge-chromatic critical graphs: a brief survey and some equivalences. <i>Lecture Notes of Seminario Interdisciplinare Di Matematica</i>, <i>14</i>, 37–48.","short":"S. Bej, E. Steffen, Lecture Notes of Seminario Interdisciplinare Di Matematica 14 (2017) 37–48.","chicago":"Bej, Saptarshi, and Eckhard Steffen. “Factors of Edge-Chromatic Critical Graphs: A Brief Survey and Some Equivalences.” <i>Lecture Notes of Seminario Interdisciplinare Di Matematica</i> 14 (2017): 37–48."},"date_created":"2019-06-07T09:52:26Z","type":"journal_article","title":"Factors of edge-chromatic critical graphs: a brief survey and some equivalences","status":"public","year":"2017","author":[{"full_name":"Bej, Saptarshi","last_name":"Bej","first_name":"Saptarshi"},{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        14","page":"37-48","language":[{"iso":"eng"}],"_id":"10156","user_id":"15540","volume":14},{"date_created":"2019-06-07T09:54:24Z","type":"journal_article","citation":{"mla":"Jin, Ligang, and Eckhard Steffen. “Petersen Cores and the Oddness of Cubic Graphs.” <i>J. Graph Theory</i>, vol. 84, 2017, pp. 109–20.","bibtex":"@article{Jin_Steffen_2017, title={Petersen cores and the oddness of cubic graphs}, volume={84}, journal={J. Graph Theory}, author={Jin, Ligang and Steffen, Eckhard}, year={2017}, pages={109–120} }","ama":"Jin L, Steffen E. Petersen cores and the oddness of cubic graphs. <i>J Graph Theory</i>. 2017;84:109-120.","ieee":"L. Jin and E. Steffen, “Petersen cores and the oddness of cubic graphs,” <i>J. Graph Theory</i>, vol. 84, pp. 109–120, 2017.","apa":"Jin, L., &#38; Steffen, E. (2017). Petersen cores and the oddness of cubic graphs. <i>J. Graph Theory</i>, <i>84</i>, 109–120.","chicago":"Jin, Ligang, and Eckhard Steffen. “Petersen Cores and the Oddness of Cubic Graphs.” <i>J. Graph Theory</i> 84 (2017): 109–20.","short":"L. Jin, E. Steffen, J. Graph Theory 84 (2017) 109–120."},"publication":"J. Graph Theory","_id":"10157","language":[{"iso":"eng"}],"page":"109 - 120 ","volume":84,"user_id":"15540","author":[{"full_name":"Jin, Ligang","first_name":"Ligang","last_name":"Jin"},{"last_name":"Steffen","first_name":"Eckhard","full_name":"Steffen, Eckhard","id":"15548"}],"title":"Petersen cores and the oddness of cubic graphs","status":"public","year":"2017","intvolume":"        84","publication_status":"published","date_updated":"2022-01-06T06:50:31Z"},{"article_number":"P3.21","language":[{"iso":"eng"}],"_id":"10158","user_id":"15540","volume":23,"title":"Face-degree bounds for planar critical graphs","year":"2016","status":"public","author":[{"first_name":"Ligang","last_name":"Jin","full_name":"Jin, Ligang"},{"full_name":"Kang, Yingli","first_name":"Yingli","last_name":"Kang"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"publication_status":"published","date_updated":"2022-01-06T06:50:31Z","intvolume":"        23","date_created":"2019-06-07T10:00:27Z","type":"journal_article","publication":"Electronic Journal of Combinatorics","issue":"3","citation":{"chicago":"Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Face-Degree Bounds for Planar Critical Graphs.” <i>Electronic Journal of Combinatorics</i> 23, no. 3 (2016).","short":"L. Jin, Y. Kang, E. Steffen, Electronic Journal of Combinatorics 23 (2016).","apa":"Jin, L., Kang, Y., &#38; Steffen, E. (2016). Face-degree bounds for planar critical graphs. <i>Electronic Journal of Combinatorics</i>, <i>23</i>(3).","ieee":"L. Jin, Y. Kang, and E. Steffen, “Face-degree bounds for planar critical graphs,” <i>Electronic Journal of Combinatorics</i>, vol. 23, no. 3, 2016.","ama":"Jin L, Kang Y, Steffen E. Face-degree bounds for planar critical graphs. <i>Electronic Journal of Combinatorics</i>. 2016;23(3).","bibtex":"@article{Jin_Kang_Steffen_2016, title={Face-degree bounds for planar critical graphs}, volume={23}, number={3P3.21}, journal={Electronic Journal of Combinatorics}, author={Jin, Ligang and Kang, Yingli and Steffen, Eckhard}, year={2016} }","mla":"Jin, Ligang, et al. “Face-Degree Bounds for Planar Critical Graphs.” <i>Electronic Journal of Combinatorics</i>, vol. 23, no. 3, P3.21, 2016."}},{"date_created":"2019-06-07T10:02:14Z","type":"journal_article","publication":"Discrete Mathematics ","citation":{"bibtex":"@article{Kang_Steffen_2016, title={The chromatic spectrum of signed graphs}, volume={339}, journal={Discrete Mathematics }, author={Kang, Yingli and Steffen, Eckhard}, year={2016}, pages={234–243} }","ama":"Kang Y, Steffen E. The chromatic spectrum of signed graphs. <i>Discrete Mathematics </i>. 2016;339:234-243.","mla":"Kang, Yingli, and Eckhard Steffen. “The Chromatic Spectrum of Signed Graphs.” <i>Discrete Mathematics </i>, vol. 339, 2016, pp. 234–43.","short":"Y. Kang, E. Steffen, Discrete Mathematics  339 (2016) 234–243.","chicago":"Kang, Yingli, and Eckhard Steffen. “The Chromatic Spectrum of Signed Graphs.” <i>Discrete Mathematics </i> 339 (2016): 234–43.","ieee":"Y. Kang and E. Steffen, “The chromatic spectrum of signed graphs,” <i>Discrete Mathematics </i>, vol. 339, pp. 234–243, 2016.","apa":"Kang, Y., &#38; Steffen, E. (2016). The chromatic spectrum of signed graphs. <i>Discrete Mathematics </i>, <i>339</i>, 234–243."},"page":"234-243","_id":"10159","language":[{"iso":"eng"}],"user_id":"15540","volume":339,"title":"The chromatic spectrum of signed graphs","status":"public","year":"2016","author":[{"full_name":"Kang, Yingli","first_name":"Yingli","last_name":"Kang"},{"full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen","id":"15548"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       339"},{"title":"Remarks on planar critical graphs","status":"public","year":"2016","author":[{"first_name":"Ligang","last_name":"Jin","full_name":"Jin, Ligang"},{"last_name":"Kang","first_name":"Yingli","full_name":"Kang, Yingli"},{"full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard","id":"15548"}],"date_updated":"2022-01-06T06:50:31Z","publication_status":"published","intvolume":"       200","page":"200–202","_id":"10160","language":[{"iso":"eng"}],"user_id":"15540","volume":200,"publication":"Discrete Applied Mathematics","citation":{"mla":"Jin, Ligang, et al. “Remarks on Planar Critical Graphs.” <i>Discrete Applied Mathematics</i>, vol. 200, 2016, pp. 200–202.","apa":"Jin, L., Kang, Y., &#38; Steffen, E. (2016). Remarks on planar critical graphs. <i>Discrete Applied Mathematics</i>, <i>200</i>, 200–202.","ieee":"L. Jin, Y. Kang, and E. Steffen, “Remarks on planar critical graphs,” <i>Discrete Applied Mathematics</i>, vol. 200, pp. 200–202, 2016.","chicago":"Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Remarks on Planar Critical Graphs.” <i>Discrete Applied Mathematics</i> 200 (2016): 200–202.","ama":"Jin L, Kang Y, Steffen E. Remarks on planar critical graphs. <i>Discrete Applied Mathematics</i>. 2016;200:200–202.","short":"L. Jin, Y. Kang, E. Steffen, Discrete Applied Mathematics 200 (2016) 200–202.","bibtex":"@article{Jin_Kang_Steffen_2016, title={Remarks on planar critical graphs}, volume={200}, journal={Discrete Applied Mathematics}, author={Jin, Ligang and Kang, Yingli and Steffen, Eckhard}, year={2016}, pages={200–202} }"},"date_created":"2019-06-07T10:04:11Z","type":"journal_article"},{"intvolume":"        52","publication_status":"published","date_updated":"2022-01-06T06:50:31Z","author":[{"last_name":"Jin","first_name":"Ligang","full_name":"Jin, Ligang"},{"full_name":"Kang, Yingli","first_name":"Yingli","last_name":"Kang"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","last_name":"Steffen"}],"status":"public","title":"Choosability in signed planar graphs","year":"2016","volume":52,"user_id":"15540","_id":"10161","language":[{"iso":"eng"}],"page":"234-243","citation":{"apa":"Jin, L., Kang, Y., &#38; Steffen, E. (2016). Choosability in signed planar graphs. <i>European J. Combinatorics</i>, <i>52</i>, 234–243.","mla":"Jin, Ligang, et al. “Choosability in Signed Planar Graphs.” <i>European J. Combinatorics</i>, vol. 52, 2016, pp. 234–43.","ieee":"L. Jin, Y. Kang, and E. Steffen, “Choosability in signed planar graphs,” <i>European J. Combinatorics</i>, vol. 52, pp. 234–243, 2016.","chicago":"Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Choosability in Signed Planar Graphs.” <i>European J. Combinatorics</i> 52 (2016): 234–43.","short":"L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.","ama":"Jin L, Kang Y, Steffen E. Choosability in signed planar graphs. <i>European J Combinatorics</i>. 2016;52:234-243.","bibtex":"@article{Jin_Kang_Steffen_2016, title={Choosability in signed planar graphs}, volume={52}, journal={European J. Combinatorics}, author={Jin, Ligang and Kang, Yingli and Steffen, Eckhard}, year={2016}, pages={234–243} }"},"publication":"European J. Combinatorics","type":"journal_article","date_created":"2019-06-07T10:07:21Z"}]