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