Eckhard Steffen Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
c2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: 1-factors and circuits of cubic graphs. CTW 2013: 213-216
2012
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Measures of edge-uncolorability. Discrete Mathematics 312(2): 476-478 (2012)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Nearly nowhere-zero r-flow graphs. Discrete Mathematics 312(18): 2757-2759 (2012)
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen: α-Labelings and the Structure of Trees with Nonzero α-Deficit. Discrete Mathematics & Theoretical Computer Science 14(1): 159-174 (2012)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Maximum Δ-edge-colorable subgraphs of class II graphs. Journal of Graph Theory 70(4): 473-482 (2012)
2010
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Discrete Mathematics 310(3): 385-389 (2010)
c1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW 2010: 129-132
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Maximum $\Delta$-edge-colorable subgraphs of class II graphs. CoRR abs/1002.0783 (2010)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Bricks and conjectures of Berge, Fulkerson and Seymour. CoRR abs/1003.5782 (2010)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vahan V. Mkrtchyan, Eckhard Steffen: Measures of edge-uncolorability. CoRR abs/1003.5783 (2010)
2007
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Electronic Notes in Discrete Mathematics 28: 239-242 (2007)
2006
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik: Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]. Discrete Applied Mathematics 154(11): 1645-1646 (2006)
2004
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Measurements of edge-uncolorability. Discrete Mathematics 280(1-3): 191-214 (2004)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stefan Grünewald, Eckhard Steffen: Independent sets and 2-factors in edge-chromatic-critical graphs. Journal of Graph Theory 45(2): 113-118 (2004)
2001
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Circular flow numbers of regular multigraphs. Journal of Graph Theory 36(1): 24-34 (2001)
2000
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hans Georg Carstens, Thomas Dinski, Eckhard Steffen: Reduction of Symmetric Configurations n3. Discrete Applied Mathematics 99(1-3): 401-411 (2000)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: A refinement of Vizing's theorem. Discrete Mathematics 218(1-3): 289-291 (2000)
1999
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Counterexamples to a conjecture about Petersen-minors in supersnarks. Discrete Mathematics 207(1-3): 291-292 (1999)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stefan Grünewald, Eckhard Steffen: Cyclically 5-edge connected non-bicritical critical snarks. Discussiones Mathematicae Graph Theory 19(1): 5-11 (1999)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Non-Bicritical Critical Snarks. Graphs and Combinatorics 15(4): 473-480 (1999)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Stefan Grünewald, Eckhard Steffen: Chromatic-index-critical graphs of even order. Journal of Graph Theory 30(1): 27-36 (1999)
1998
j7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gunnar Brinkmann, Eckhard Steffen: Snarks and Reducibility. Ars Comb. 50 (1998)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Classifications and characterizations of snarks. Discrete Mathematics 188(1-3): 183-203 (1998)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gunnar Brinkmann, Eckhard Steffen: Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. 19(8): 889-900 (1998)
1997
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gunnar Brinkmann, Eckhard Steffen: 3- and 4-critical graphs of small even order. Discrete Mathematics 169(1-3): 193-197 (1997)
1996
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen, Xuding Zhu: Star Chromatic Numbers of Graphs. Combinatorica 16(3): 439-448 (1996)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discrete Mathematics 161(1-3): 315 (1996)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eckhard Steffen: Tutte's 5-flow conjecture for graphs of nonorientable genus 5. Journal of Graph Theory 22(4): 309-319 (1996)

Coauthor Index

1Marko Boben
[j17]
2Gunnar Brinkmann
[j21] [j7] [j5] [j4]
3Hans Georg Carstens
[j13]
4Simon Crevals
[j21]
5Thomas Dinski
[j13]
6Stefan Grünewald
[j15] [j10] [j8]
7Vahan V. Mkrtchyan
[j23] [j20] [c1] [i3] [i2] [i1]
8Hadrien Mélot
[j21]
9Tomaz Pisanski
[j17]
10Natasa Ravnik
[j17]
11Leanne Rylands
[j21]
12Xuding Zhu
[j3]
Last update Thu May 23 22:58:04 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page