---
_id: '21827'
author:
- first_name: Antje
  full_name: Klopp, Antje
  last_name: Klopp
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
  orcid: 0000-0002-9808-7401
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>
  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>
  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} }'
  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>.
  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>.'
  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>.
  short: A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.
date_created: 2021-04-30T07:22:24Z
date_updated: 2023-05-16T10:45:10Z
doi: 10.1007/s00373-020-02266-6
external_id:
  arxiv:
  - '1903.12385'
language:
- iso: eng
page: 559-580
publication: Graphs and Combinatorics
publication_identifier:
  issn:
  - 0911-0119
  - 1435-5914
publication_status: published
status: public
title: Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
type: journal_article
user_id: '15540'
year: '2021'
...
---
_id: '13445'
author:
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
  orcid: 0000-0002-9808-7401
- first_name: Alexander
  full_name: Vogel, Alexander
  last_name: Vogel
citation:
  ama: Steffen E, Vogel A. Concepts of signed graph coloring. <i>European J Combinatorics</i>.
    2021;91.
  apa: Steffen, E., &#38; Vogel, A. (2021). Concepts of signed graph coloring. <i>European
    J. Combinatorics</i>, <i>91</i>.
  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} }'
  chicago: Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.”
    <i>European J. Combinatorics</i> 91 (2021).
  ieee: E. Steffen and A. Vogel, “Concepts of signed graph coloring,” <i>European
    J. Combinatorics</i>, vol. 91, 2021.
  mla: Steffen, Eckhard, and Alexander Vogel. “Concepts of Signed Graph Coloring.”
    <i>European J. Combinatorics</i>, vol. 91, 2021.
  short: E. Steffen, A. Vogel, European J. Combinatorics 91 (2021).
date_created: 2019-09-24T14:19:42Z
date_updated: 2023-05-16T10:46:55Z
external_id:
  arxiv:
  - '1909.09381'
intvolume: '        91'
language:
- iso: eng
publication: European J. Combinatorics
status: public
title: Concepts of signed graph coloring
type: journal_article
user_id: '15540'
volume: 91
year: '2021'
...
---
_id: '13114'
author:
- first_name: You
  full_name: Lu, You
  last_name: Lu
- first_name: Rong
  full_name: Luo, Rong
  last_name: Luo
- first_name: Michael
  full_name: Schubert, Michael
  last_name: Schubert
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
  orcid: 0000-0002-9808-7401
- first_name: Cun-Quan
  full_name: Zhang, Cun-Quan
  last_name: Zhang
citation:
  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>
  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} }'
  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>.'
  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>.
  short: Y. Lu, R. Luo, M. Schubert, E. Steffen, C.-Q. Zhang, SIAM J. Discrete Math
    34 (4) (2020) 2166–2187.
date_created: 2019-08-30T12:37:18Z
date_updated: 2023-05-16T10:43:39Z
doi: 10.1137/18M1222818
external_id:
  arxiv:
  - '1908.11004'
language:
- iso: eng
page: 2166-2187
publication: SIAM J. Discrete Math
status: public
title: Flows on signed graphs without long barbells
type: journal_article
user_id: '15540'
volume: 34 (4)
year: '2020'
...
---
_id: '12971'
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
  orcid: 0000-0002-9808-7401
citation:
  ama: Jin L, Steffen E. Unions of 1-factors in r-graphs and overfull graphs. <i>J
    of Combinatorics</i>. 2020;11: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.
  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} }'
  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.'
  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.
  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.
  short: L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.
date_created: 2019-08-26T13:53:51Z
date_updated: 2023-05-16T10:53:21Z
external_id:
  arxiv:
  - '1509.01823'
intvolume: '        11'
language:
- iso: eng
page: 457-473
publication: J. of Combinatorics
status: public
title: Unions of 1-factors in r-graphs and overfull graphs
type: journal_article
user_id: '15540'
volume: 11
year: '2020'
...
---
_id: '16938'
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Günter W.
  full_name: Maier, Günter W.
  last_name: Maier
- first_name: Sonja K.
  full_name: Ötting, Sonja K.
  last_name: Ötting
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
- first_name: Alexander
  full_name: Teetz, Alexander
  last_name: Teetz
citation:
  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>'
  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>'
  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} }'
  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>.'
  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.'
  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>.
  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.'
date_created: 2020-05-05T15:38:22Z
date_updated: 2022-01-06T06:52:59Z
department:
- _id: '66'
doi: 10.1007/978-3-662-49266-6_16
editor:
- first_name: Steffen
  full_name: Wischmann, Steffen
  last_name: Wischmann
- first_name: Ernst Andreas
  full_name: Hartmann, Ernst Andreas
  last_name: Hartmann
language:
- iso: eng
page: 221-231
place: Berlin, Heidelberg
publication: Zukunft der Arbeit – Eine praxisnahe Betrachtung
publication_identifier:
  isbn:
  - '9783662492659'
  - '9783662492666'
publication_status: published
publisher: Springer Verlag
status: public
title: Gerechtigkeit in flexiblen Arbeits- und Managementprozessen
type: book_chapter
user_id: '57458'
year: '2018'
...
---
_id: '10129'
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
article_type: original
author:
- first_name: M. A.
  full_name: Fiol, M. A.
  last_name: Fiol
- first_name: Guiseppe
  full_name: Mazzuoccolo, Guiseppe
  last_name: Mazzuoccolo
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Fiol MA, Mazzuoccolo G, Steffen E. Measures of Edge-Uncolorability of Cubic
    Graphs. <i>The Electronic Journal of Combinatorics</i>. 2018;25(4).
  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).
  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).
  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.
  short: M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics
    25 (2018).
date_created: 2019-06-05T09:59:10Z
date_updated: 2022-01-06T06:50:30Z
department:
- _id: '542'
intvolume: '        25'
issue: '4'
keyword:
- Cubic graph
- Tait coloring
- Snark
- Boole coloring
- Berge's conjecture
- Tutte's 5-flow conjecture
language:
- iso: eng
publication: The Electronic Journal of Combinatorics
status: public
title: Measures of Edge-Uncolorability of Cubic Graphs
type: journal_article
user_id: '15540'
volume: 25
year: '2018'
...
---
_id: '10130'
article_number: P2.40
author:
- first_name: Edita
  full_name: Rollová, Edita
  last_name: Rollová
- first_name: Michael
  full_name: Schubert, Michael
  last_name: Schubert
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  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>
  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>.
  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>.
  short: E. Rollová, M. Schubert, E. Steffen, The Electronic Journal of Combinatorics
    25 (2018).
date_created: 2019-06-05T10:03:06Z
date_updated: 2022-01-06T06:50:30Z
doi: 10.37236/4458
intvolume: '        25'
issue: '2'
language:
- iso: eng
publication: The Electronic Journal of Combinatorics
publication_status: published
status: public
title: 'Flows in Signed Graphs with Two Negative Edges '
type: journal_article
user_id: '15540'
volume: 25
year: '2018'
...
---
_id: '10132'
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Giuseppe
  full_name: Mazzuoccolo, Giuseppe
  last_name: Mazzuoccolo
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  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>
  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} }'
  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>.'
  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.
  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>.
  short: L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory
    38 (2018) 165–175.
date_created: 2019-06-05T10:08:41Z
date_updated: 2022-01-06T06:50:30Z
department:
- _id: '542'
doi: 10.7151/dmgt.1999
intvolume: '        38'
language:
- iso: eng
page: 165-175
publication: Discussiones Mathematicae Graph Theory
publication_identifier:
  issn:
  - 1234-3099
  - 2083-5892
publication_status: published
status: public
title: Cores, joins  and the Fano-flow conjectures
type: journal_article
user_id: '15540'
volume: 38
year: '2018'
...
---
_id: '10142'
author:
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Steffen E. Approximating Vizing’s independence number conjecture. <i>Australasian
    Journal of Combinatorics</i>. 2018;71(1):153-160.
  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} }'
  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.
  mla: Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.”
    <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, 2018, pp. 153–60.
  short: E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.
date_created: 2019-06-07T08:36:36Z
date_updated: 2022-01-06T06:50:31Z
department:
- _id: '542'
intvolume: '        71'
issue: '1'
language:
- iso: eng
page: 153-160
publication: Australasian Journal of Combinatorics
publication_status: published
status: public
title: Approximating Vizing’s independence number conjecture
type: journal_article
user_id: '15540'
volume: 71
year: '2018'
...
---
_id: '10146'
alternative_title:
- Springer Reference Psychologie
citation:
  ama: Maier GW, Engels G, Steffen E, 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.
  bibtex: '@book{Maier_Engels_Steffen_2017, edition={1}, title={Handbuch Gestaltung
    digitaler und vernetzter Arbeitswelten}, publisher={Springer Berlin Heidelberg},
    year={2017} }'
  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.
  ieee: G. W. Maier, G. Engels, and E. Steffen, Eds., <i>Handbuch Gestaltung digitaler
    und vernetzter Arbeitswelten</i>, 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.
  short: G.W. Maier, G. Engels, E. Steffen, eds., Handbuch Gestaltung digitaler und
    vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017.
date_created: 2019-06-07T08:53:13Z
date_updated: 2022-01-06T06:50:31Z
edition: '1'
editor:
- first_name: Günter W.
  full_name: Maier, Günter W.
  last_name: Maier
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
language:
- iso: ger
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Handbuch Gestaltung digitaler und vernetzter Arbeitswelten
type: book_editor
user_id: '15540'
year: '2017'
...
---
_id: '10147'
author:
- first_name: Dagmar
  full_name: Simon, Dagmar
  last_name: Simon
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
  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.'
  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.'
date_created: 2019-06-07T08:57:03Z
date_updated: 2022-01-06T06:50:31Z
department:
- _id: '422'
edition: '1'
editor:
- first_name: Günter W.
  full_name: Maier, Günter W.
  last_name: Maier
- first_name: Gregor
  full_name: Engels, Gregor
  last_name: Engels
- first_name: Eckhard
  full_name: Steffen, Eckhard
  last_name: Steffen
language:
- iso: ger
page: 1-12
publication: Handbuch Gestaltung digitaler und vernetzter Arbeitswelten,
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: 'Digitale Zukunft: ein inter- und transdisziplinäres Thema'
type: book_chapter
user_id: '15540'
year: '2017'
...
---
_id: '10155'
author:
- first_name: Guiseppe
  full_name: Mazzuoccolo, Guiseppe
  last_name: Mazzuoccolo
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Mazzuoccolo G, Steffen E. Nowhere-zero 5-flows on cubic graphs with oddness
    4. <i>J Graph Theory</i>. 2017;85: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.
  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} }'
  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.'
  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.
  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.
  short: G. Mazzuoccolo, E. Steffen, J. Graph Theory 85 (2017) 363 – 371.
date_created: 2019-06-07T09:50:24Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        85'
language:
- iso: eng
page: '363 – 371 '
publication: J. Graph Theory
publication_status: published
status: public
title: Nowhere-zero 5-flows on cubic graphs with oddness 4
type: journal_article
user_id: '15540'
volume: 85
year: '2017'
...
---
_id: '10156'
author:
- first_name: Saptarshi
  full_name: Bej, Saptarshi
  last_name: Bej
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
  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.'
  short: S. Bej, E. Steffen, Lecture Notes of Seminario Interdisciplinare Di Matematica
    14 (2017) 37–48.
date_created: 2019-06-07T09:52:26Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        14'
language:
- iso: eng
page: 37-48
publication: Lecture Notes of Seminario Interdisciplinare di Matematica
publication_status: published
status: public
title: 'Factors of edge-chromatic critical graphs: a brief survey and some equivalences'
type: journal_article
user_id: '15540'
volume: 14
year: '2017'
...
---
_id: '10157'
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Jin L, Steffen E. Petersen cores and the oddness of cubic graphs. <i>J Graph
    Theory</i>. 2017;84:109-120.
  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.
  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} }'
  chicago: 'Jin, Ligang, and Eckhard Steffen. “Petersen Cores and the Oddness of Cubic
    Graphs.” <i>J. Graph Theory</i> 84 (2017): 109–20.'
  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.
  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.
  short: L. Jin, E. Steffen, J. Graph Theory 84 (2017) 109–120.
date_created: 2019-06-07T09:54:24Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        84'
language:
- iso: eng
page: '109 - 120 '
publication: J. Graph Theory
publication_status: published
status: public
title: Petersen cores and the oddness of cubic graphs
type: journal_article
user_id: '15540'
volume: 84
year: '2017'
...
---
_id: '10158'
article_number: P3.21
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Yingli
  full_name: Kang, Yingli
  last_name: Kang
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Jin L, Kang Y, Steffen E. Face-degree bounds for planar critical graphs. <i>Electronic
    Journal of Combinatorics</i>. 2016;23(3).
  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).
  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} }'
  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).
  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.
  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.
  short: L. Jin, Y. Kang, E. Steffen, Electronic Journal of Combinatorics 23 (2016).
date_created: 2019-06-07T10:00:27Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        23'
issue: '3'
language:
- iso: eng
publication: Electronic Journal of Combinatorics
publication_status: published
status: public
title: Face-degree bounds for planar critical graphs
type: journal_article
user_id: '15540'
volume: 23
year: '2016'
...
---
_id: '10159'
author:
- first_name: Yingli
  full_name: Kang, Yingli
  last_name: Kang
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Kang Y, Steffen E. The chromatic spectrum of signed graphs. <i>Discrete Mathematics
    </i>. 2016;339:234-243.
  apa: Kang, Y., &#38; Steffen, E. (2016). The chromatic spectrum of signed graphs.
    <i>Discrete Mathematics </i>, <i>339</i>, 234–243.
  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} }'
  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.
  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.
date_created: 2019-06-07T10:02:14Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '       339'
language:
- iso: eng
page: 234-243
publication: 'Discrete Mathematics '
publication_status: published
status: public
title: The chromatic spectrum of signed graphs
type: journal_article
user_id: '15540'
volume: 339
year: '2016'
...
---
_id: '10160'
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Yingli
  full_name: Kang, Yingli
  last_name: Kang
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Jin L, Kang Y, Steffen E. Remarks on planar critical graphs. <i>Discrete Applied
    Mathematics</i>. 2016;200: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.
  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} }'
  chicago: 'Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Remarks on Planar Critical
    Graphs.” <i>Discrete Applied Mathematics</i> 200 (2016): 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.
  mla: Jin, Ligang, et al. “Remarks on Planar Critical Graphs.” <i>Discrete Applied
    Mathematics</i>, vol. 200, 2016, pp. 200–202.
  short: L. Jin, Y. Kang, E. Steffen, Discrete Applied Mathematics 200 (2016) 200–202.
date_created: 2019-06-07T10:04:11Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '       200'
language:
- iso: eng
page: 200–202
publication: Discrete Applied Mathematics
publication_status: published
status: public
title: Remarks on planar critical graphs
type: journal_article
user_id: '15540'
volume: 200
year: '2016'
...
---
_id: '10161'
author:
- first_name: Ligang
  full_name: Jin, Ligang
  last_name: Jin
- first_name: Yingli
  full_name: Kang, Yingli
  last_name: Kang
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Jin L, Kang Y, Steffen E. Choosability in signed planar graphs. <i>European
    J Combinatorics</i>. 2016;52:234-243.
  apa: Jin, L., Kang, Y., &#38; Steffen, E. (2016). Choosability in signed planar
    graphs. <i>European J. Combinatorics</i>, <i>52</i>, 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} }'
  chicago: 'Jin, Ligang, Yingli Kang, and Eckhard Steffen. “Choosability in Signed
    Planar Graphs.” <i>European J. Combinatorics</i> 52 (2016): 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.
  mla: Jin, Ligang, et al. “Choosability in Signed Planar Graphs.” <i>European J.
    Combinatorics</i>, vol. 52, 2016, pp. 234–43.
  short: L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.
date_created: 2019-06-07T10:07:21Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        52'
language:
- iso: eng
page: 234-243
publication: European J. Combinatorics
publication_status: published
status: public
title: Choosability in signed planar graphs
type: journal_article
user_id: '15540'
volume: 52
year: '2016'
...
---
_id: '10162'
author:
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Steffen E. Intersecting 1-factors and nowhere-zero 5-flows. <i>Combinatorica</i>.
    2015;35:633-640.
  apa: Steffen, E. (2015). Intersecting 1-factors and nowhere-zero 5-flows. <i>Combinatorica</i>,
    <i>35</i>, 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} }'
  chicago: 'Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” <i>Combinatorica</i>
    35 (2015): 633–40.'
  ieee: E. Steffen, “Intersecting 1-factors and nowhere-zero 5-flows,” <i>Combinatorica</i>,
    vol. 35, pp. 633–640, 2015.
  mla: Steffen, Eckhard. “Intersecting 1-Factors and Nowhere-Zero 5-Flows.” <i>Combinatorica</i>,
    vol. 35, 2015, pp. 633–40.
  short: E. Steffen, Combinatorica 35 (2015) 633–640.
date_created: 2019-06-07T10:09:46Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        35'
language:
- iso: eng
page: 633-640
publication: Combinatorica
publication_status: published
status: public
title: Intersecting 1-factors and nowhere-zero 5-flows
type: journal_article
user_id: '15540'
volume: 35
year: '2015'
...
---
_id: '10163'
author:
- first_name: Eckhard
  full_name: Steffen, Eckhard
  id: '15548'
  last_name: Steffen
citation:
  ama: Steffen E. Edge-colorings and circular flow numbers of regular graphs. <i>J
    Graph Theory</i>. 2015;79:1-7.
  apa: Steffen, E. (2015). Edge-colorings and circular flow numbers of regular graphs.
    <i>J. Graph Theory</i>, <i>79</i>, 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} }'
  chicago: 'Steffen, Eckhard. “Edge-Colorings and Circular Flow Numbers of Regular
    Graphs.” <i>J. Graph Theory</i> 79 (2015): 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.
  mla: Steffen, Eckhard. “Edge-Colorings and Circular Flow Numbers of Regular Graphs.”
    <i>J. Graph Theory</i>, vol. 79, 2015, pp. 1–7.
  short: E. Steffen, J. Graph Theory 79 (2015) 1–7.
date_created: 2019-06-07T10:13:36Z
date_updated: 2022-01-06T06:50:31Z
intvolume: '        79'
language:
- iso: eng
page: 1-7
publication: J. Graph Theory
publication_status: published
status: public
title: Edge-colorings and circular flow numbers of regular graphs
type: journal_article
user_id: '15540'
volume: 79
year: '2015'
...