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