LibreCat – Publication List Manager

Eckhard Steffen

Diskrete Mathematik/Graphentheorie

es@uni-paderborn.de

15548

69 Publications

Mark all

[69]

2024 | Preprint | LibreCat-ID: 52342

Dalfó, C., Fiol, M. A., & Steffen, E. (2024). On token signed graphs. In arXiv:2403.02924.

LibreCat | arXiv

[68]

2024 | Journal Article | LibreCat-ID: 49905

Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2024). Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Combinatorica, 44, 429–440. https://doi.org/10.1007/s00493-023-00078-9

LibreCat | DOI

[67]

2023 | Preprint | LibreCat-ID: 44501

Cappello, C., Naserasr, R., Steffen, E., & Wang, Z. (2023). Critically 3-frustrated signed graphs. In arXiv:2304.10243.

LibreCat | arXiv

[66]

2023 | Journal Article | LibreCat-ID: 44857

Silva, H. O. M., Rubert, D. P., Araujo, E., Steffen, E., Doerr, D., & Martinez, F. V. (2023). Algorithms for the genome median under a restricted measure of rearrangement. RAIRO - Operations Research, 57(3), 1045–1058. https://doi.org/10.1051/ro/2023052

LibreCat | DOI

[65]

2023 | Preprint | LibreCat-ID: 44859

Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2023). Sets of r-graphs that color all r-graphs. In arXiv:2305.08619.

LibreCat | arXiv

[64]

2023 | Journal Article | LibreCat-ID: 46256

Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2023). Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs. SIAM Journal on Discrete Mathematics, 37(3), 1548–1565. https://doi.org/10.1137/22m1500654

LibreCat | DOI

[63]

2023 | Journal Article | LibreCat-ID: 51351

Steffen, E., & Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. Discrete Applied Mathematics, 337, 185–189. https://doi.org/10.1016/j.dam.2023.05.008

LibreCat | DOI

[62]

2023 | Book Chapter | LibreCat-ID: 45190

Cappello, C., & Steffen, E. (2023). Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks. In The Digital Twin of Humans (pp. 93--110). Springer International Publishing. https://doi.org/10.1007/978-3-031-26104-6_5

LibreCat | DOI

[61]

2023 | Journal Article | LibreCat-ID: 51357

Steffen, E., & Wolf, I. H. (2023). Rotation r-graphs. Discrete Mathematics, Article 113457. https://doi.org/10.1016/j.disc.2023.113457

LibreCat | DOI

[60]

2023 | Book Chapter | LibreCat-ID: 45110

Gräßler, I., Steffen, E., Maier, G. W., & Roesmann, D. (2023). Introduction—The Digital Twin of Humans. In I. Gräßler, G. W. Maier, E. Steffen, & D. Roesmann (Eds.), The Digital Twin of Humans (pp. 3–10). Springer International Publishing. https://doi.org/10.1007/978-3-031-26104-6_1

LibreCat | Files available | DOI

[59]

2023 | Book (Editor) | LibreCat-ID: 45191

Gräßler, I., Maier, G. W., Steffen, E., & Roesmann, D. (Eds.). (2023). The Digital Twin of Humans. Springer International Publishing. https://doi.org/10.1007/978-3-031-26104-6

LibreCat | DOI

[58]

2022 | Journal Article | LibreCat-ID: 33741

Cappello, C., & Steffen, E. (2022). Symmetric Set Coloring of Signed Graphs. Annals of Combinatorics. https://doi.org/10.1007/s00026-022-00593-4

LibreCat | DOI | arXiv

[57]

2022 | Journal Article | LibreCat-ID: 31543

Steffen, E., & Wolf, I. H. (2022). Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. Graphs and Combinatorics, 38(3), Article 104. https://doi.org/10.1007/s00373-022-02506-x

LibreCat | DOI | arXiv

[56]

2022 | Journal Article | LibreCat-ID: 33950

Cappello, C., & Steffen, E. (2022). Frustration-critical signed graphs. Discrete Applied Mathematics, 322, 183–193. https://doi.org/10.1016/j.dam.2022.08.010

LibreCat | DOI | arXiv

[55]

2022 | Journal Article | LibreCat-ID: 26408

Mattiolo, D., & Steffen, E. (2022). Edge colorings and circular flows on regular graphs. Journal of Graph Theory, 99(3), 399–413. https://doi.org/10.1002/jgt.22746

LibreCat | DOI | arXiv

[54]

2021 | Conference Paper | LibreCat-ID: 22287

Gräßler, I., Roesmann, D., Cappello, C., & Steffen, E. (2021). Skill-based worker assignment in a manual assembly line. In E. Lutters (Ed.), Procedia CIRP Design (pp. 433–438). Elsevier. https://doi.org/10.1016/j.procir.2021.05.100

LibreCat | DOI

[53]

2021 | Journal Article | LibreCat-ID: 23456

Mattiolo, D., & Steffen, E. (2021). Highly edge‐connected regular graphs without large factorizable subgraphs. Journal of Graph Theory, 99(1), 107–116. https://doi.org/10.1002/jgt.22729

LibreCat | DOI | arXiv

[52]

2021 | Journal Article | LibreCat-ID: 21827

Klopp, A., & Steffen, E. (2021). Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. Graphs and Combinatorics, 559–580. https://doi.org/10.1007/s00373-020-02266-6

LibreCat | DOI | arXiv

[51]

2021 | Journal Article | LibreCat-ID: 13445

Steffen, E., & Vogel, A. (2021). Concepts of signed graph coloring. European J. Combinatorics, 91.

LibreCat | arXiv

[50]

2020 | Journal Article | LibreCat-ID: 13114

Lu, Y., Luo, R., Schubert, M., Steffen, E., & Zhang, C.-Q. (2020). Flows on signed graphs without long barbells. SIAM J. Discrete Math, 34 (4), 2166–2187. https://doi.org/10.1137/18M1222818

LibreCat | DOI | arXiv

[49]

2020 | Journal Article | LibreCat-ID: 12971

Jin, L., & Steffen, E. (2020). Unions of 1-factors in r-graphs and overfull graphs. J. of Combinatorics, 11, 457–473.

LibreCat | arXiv

[48]

2018 | Book Chapter | LibreCat-ID: 16938

Engels, G., Maier, G. W., Ötting, S. K., Steffen, E., & Teetz, A. (2018). Gerechtigkeit in flexiblen Arbeits- und Managementprozessen. In S. Wischmann & E. A. Hartmann (Eds.), Zukunft der Arbeit – Eine praxisnahe Betrachtung (pp. 221–231). Berlin, Heidelberg: Springer Verlag. https://doi.org/10.1007/978-3-662-49266-6_16

LibreCat | DOI

[47]

2018 | Journal Article | LibreCat-ID: 10129

Fiol, M. A., Mazzuoccolo, G., & Steffen, E. (2018). Measures of Edge-Uncolorability of Cubic Graphs. The Electronic Journal of Combinatorics, 25(4).

LibreCat

[46]

2018 | Journal Article | LibreCat-ID: 10130

Rollová, E., Schubert, M., & Steffen, E. (2018). Flows in Signed Graphs with Two Negative Edges . The Electronic Journal of Combinatorics, 25(2). https://doi.org/10.37236/4458

LibreCat | DOI

[45]

2018 | Journal Article | LibreCat-ID: 10132

Jin, L., Mazzuoccolo, G., & Steffen, E. (2018). Cores, joins and the Fano-flow conjectures. Discussiones Mathematicae Graph Theory, 38, 165–175. https://doi.org/10.7151/dmgt.1999

LibreCat | DOI

[44]

2018 | Journal Article | LibreCat-ID: 10142

Steffen, E. (2018). Approximating Vizing’s independence number conjecture. Australasian Journal of Combinatorics, 71(1), 153–160.

LibreCat

[43]

2017 | Book (Editor) | LibreCat-ID: 10146

Maier, G. W., Engels, G., & Steffen, E. (Eds.). (2017). Handbuch Gestaltung digitaler und vernetzter Arbeitswelten (1st ed.). Springer Berlin Heidelberg.

LibreCat

[42]

2017 | Book Chapter | LibreCat-ID: 10147

Simon, D., & Steffen, E. (2017). Digitale Zukunft: ein inter- und transdisziplinäres Thema. In G. W. Maier, G. Engels, & E. Steffen (Eds.), Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, (1st ed., pp. 1–12). Springer Berlin Heidelberg.

LibreCat

[41]

2017 | Journal Article | LibreCat-ID: 10155

Mazzuoccolo, G., & Steffen, E. (2017). Nowhere-zero 5-flows on cubic graphs with oddness 4. J. Graph Theory, 85, 363 – 371.

LibreCat

[40]

2017 | Journal Article | LibreCat-ID: 10156

Bej, S., & Steffen, E. (2017). Factors of edge-chromatic critical graphs: a brief survey and some equivalences. Lecture Notes of Seminario Interdisciplinare Di Matematica, 14, 37–48.

LibreCat

[39]

2017 | Journal Article | LibreCat-ID: 10157

Jin, L., & Steffen, E. (2017). Petersen cores and the oddness of cubic graphs. J. Graph Theory, 84, 109–120.

LibreCat

[38]

2016 | Journal Article | LibreCat-ID: 10158

Jin, L., Kang, Y., & Steffen, E. (2016). Face-degree bounds for planar critical graphs. Electronic Journal of Combinatorics, 23(3).

LibreCat

[37]

2016 | Journal Article | LibreCat-ID: 10159

Kang, Y., & Steffen, E. (2016). The chromatic spectrum of signed graphs. Discrete Mathematics , 339, 234–243.

LibreCat

[36]

2016 | Journal Article | LibreCat-ID: 10160

Jin, L., Kang, Y., & Steffen, E. (2016). Remarks on planar critical graphs. Discrete Applied Mathematics, 200, 200–202.

LibreCat

[35]

2016 | Journal Article | LibreCat-ID: 10161

Jin, L., Kang, Y., & Steffen, E. (2016). Choosability in signed planar graphs. European J. Combinatorics, 52, 234–243.

LibreCat

[34]

2015 | Journal Article | LibreCat-ID: 10162

Steffen, E. (2015). Intersecting 1-factors and nowhere-zero 5-flows. Combinatorica, 35, 633–640.

LibreCat

[33]

2015 | Journal Article | LibreCat-ID: 10163

Steffen, E. (2015). Edge-colorings and circular flow numbers of regular graphs. J. Graph Theory, 79, 1–7.

LibreCat

[32]

2015 | Journal Article | LibreCat-ID: 10164

Máčajová, E., & Steffen, E. (2015). The difference between the circular and the integer flow number of bidirected graphs. Discrete Mathematics, 338, 866–867.

LibreCat

[31]

2015 | Journal Article | LibreCat-ID: 10165

Steffen, E. (2015). 1-factor-and cycle covers of cubic graphs. J. Graph Theory, 78(3), 195 – 206.

LibreCat

[30]

2015 | Journal Article | LibreCat-ID: 10166

Schubert, M., & Steffen, E. (2015). Nowhere-zero flows on signed regular graphs. European J. Combinatorics, 48, 34–47.

LibreCat

[29]

2014 | Journal Article | LibreCat-ID: 10167

Schubert, M., & Steffen, E. (2014). The set of circular flow numbers of regular graphs. J. Graph Theory, 76, 297–308.

LibreCat

[28]

2014 | Journal Article | LibreCat-ID: 10169

Hägglund, J., & Steffen, E. (2014). Petersen colorings and some families of snarks. Ars Mathematica Contemporanea, 312, 476–478.

LibreCat

[27]

2012 | Journal Article | LibreCat-ID: 10170

Brinkmann, G., Crevals, Simon, Melot, H., Rylands, Leanne J., & Steffen, E. (2012). α-labelings and the structure of trees with nonzero α-deficit . Discrete Mathematics. and Theoretical Computer Science, 14.1, 159–174.

LibreCat

[26]

2012 | Journal Article | LibreCat-ID: 10171

Steffen, E. (2012). Nearly nowhere-zero r-flow graphs. Discrete Mathematics, 312, 2757–2759.

LibreCat

[25]

2012 | Journal Article | LibreCat-ID: 10172

Mkrtchyan, V., & Steffen, E. (2012). Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory, 70, 473–482.

LibreCat

[24]

2012 | Journal Article | LibreCat-ID: 10173

Mkrtchyan, V., & Steffen, E. (2012). Measures of edge-uncolorability. Discrete Mathematics, 312, 476–478.

LibreCat

[23]

2010 | Journal Article | LibreCat-ID: 10174

Steffen, E. (2010). Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs. Discrete Mathematics, 310, 385–389.

LibreCat

[22]

2010 | Preprint | LibreCat-ID: 10202

Mkrtchyan, V., & Steffen, E. (2010). Bricks and conjectures of Berge, Fulkerson and Seymour. ArXiv:1003.5782.

LibreCat

[21]

2008 | Journal Article | LibreCat-ID: 10175

Mohar, B., Steffen, E., & Vodopivec, A. (2008). Relating embedding and coloring properties of snarks. Ars Mathematica Contemporanea, 1, 169–184.

LibreCat

[20]

2006 | Journal Article | LibreCat-ID: 10176

Boben, M., Pisanski, T., Ravnik, N., & Steffen, E. (2006). Erratum to „Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 154(11), 1645–1646.

LibreCat

[19]

2004 | Journal Article | LibreCat-ID: 10177

Steffen, E. (2004). Measurements of edge-uncolorability. Discrete Mathematics, 280, 191–214.

LibreCat

[18]

2004 | Journal Article | LibreCat-ID: 10178

Grünewald, S., & Steffen, E. (2004). Independent Sets and 2-factors in edge-chromatic critical graphs. J. Graph Theory, 45, 113–118.

LibreCat

[17]

2001 | Journal Article | LibreCat-ID: 10179

Steffen, E. (2001). Circular flow numbers of regular multigraphs. J. Graph Theory, 36, 24–34.

LibreCat

[16]

2001 | Journal Article | LibreCat-ID: 10180

Steffen, E. (2001). On bicritical snarks. Math. Slovaca, 51, 141–150.

LibreCat

[15]

2000 | Journal Article | LibreCat-ID: 10182

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.

LibreCat

[14]

2000 | Journal Article | LibreCat-ID: 10183

Steffen, E. (2000). A refinement of Vizing’s theorem. Discrete Mathematics, 218, 289–291.

LibreCat

[13]

2000 | Journal Article | LibreCat-ID: 10186

Carstens, H. G., Dinski, T., & Steffen, E. (2000). Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 99, 401–411.

LibreCat

[12]

1999 | Journal Article | LibreCat-ID: 10187

Steffen, E. (1999). Counterexamples to a conjecture about Petersen-minors in supersnarks. Discrete Mathematics, 207, 291–292.

LibreCat

[11]

1999 | Journal Article | LibreCat-ID: 10189

Steffen, E. (1999). Non-bicritical critical snarks. Graphs Comb., 15, 473–480.

LibreCat

[10]

1999 | Journal Article | LibreCat-ID: 10190

Grünewald, S., & Steffen, E. (1999). Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory, 19, 5–11.

LibreCat

[9]

1999 | Journal Article | LibreCat-ID: 10191

Grünewald, S., & Steffen, E. (1999). Chromatic-index-critical graphs of even order. J. Graph Theory, 30, 27–36.

LibreCat

[8]

1998 | Journal Article | LibreCat-ID: 10193

Brinkmann, G., & Steffen, E. (1998). Snarks and reducibility. Ars Combinatoria, 50, 292–296.

LibreCat

[7]

1998 | Journal Article | LibreCat-ID: 10194

Brinkmann, G., & Steffen, E. (1998). Chromatic-index-critical graphs of Orders 11 and 12. European J. Combinatorics, 19, 889–900.

LibreCat

[6]

1998 | Journal Article | LibreCat-ID: 10195

Steffen, E. (1998). Classification and characterizations of snarkse. Discrete Mathematics, 188, 183-203 (.

LibreCat

[5]

1997 | Journal Article | LibreCat-ID: 10196

Brinkmann, G., & Steffen, E. (1997). 3- and 4-critical graphs of small even order. Discrete Mathematics, 188, 193–197.

LibreCat

[4]

1996 | Journal Article | LibreCat-ID: 10197

Steffen, E. (1996). Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discrete Mathematics, 161, 315.

LibreCat

[3]

1996 | Journal Article | LibreCat-ID: 10198

Steffen, E., & Zhu, X. (1996). Star chromatic numbers of graphs. Combinatorica, 16, 439–448.

LibreCat

[2]

1996 | Journal Article | LibreCat-ID: 10199

Steffen, E. (1996). Tutte’s 5-flow conjecture for graphs of non-orientable genus 5. J. Graph Theory, 22, 309–319.

LibreCat

[1]

1992 | Conference Paper | LibreCat-ID: 10201

Steffen, E. (1992). Complexity results for the default- and autoepistemic logic. In E. Börger (Ed.), Computer Science Logic (Vol. 626, pp. 339–352). Springer Berlin Heidelberg.

LibreCat

69 Publications

Mark all

[69]

2024 | Preprint | LibreCat-ID: 52342

Dalfó, C., Fiol, M. A., & Steffen, E. (2024). On token signed graphs. In arXiv:2403.02924.

LibreCat | arXiv

[68]

2024 | Journal Article | LibreCat-ID: 49905

LibreCat | DOI

[67]

2023 | Preprint | LibreCat-ID: 44501

Cappello, C., Naserasr, R., Steffen, E., & Wang, Z. (2023). Critically 3-frustrated signed graphs. In arXiv:2304.10243.

LibreCat | arXiv

[66]

2023 | Journal Article | LibreCat-ID: 44857

LibreCat | DOI

[65]

2023 | Preprint | LibreCat-ID: 44859

Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2023). Sets of r-graphs that color all r-graphs. In arXiv:2305.08619.

LibreCat | arXiv

[64]

2023 | Journal Article | LibreCat-ID: 46256

LibreCat | DOI

[63]

2023 | Journal Article | LibreCat-ID: 51351

Steffen, E., & Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. Discrete Applied Mathematics, 337, 185–189. https://doi.org/10.1016/j.dam.2023.05.008

LibreCat | DOI

[62]

2023 | Book Chapter | LibreCat-ID: 45190

LibreCat | DOI

[61]

2023 | Journal Article | LibreCat-ID: 51357

Steffen, E., & Wolf, I. H. (2023). Rotation r-graphs. Discrete Mathematics, Article 113457. https://doi.org/10.1016/j.disc.2023.113457

LibreCat | DOI

[60]

2023 | Book Chapter | LibreCat-ID: 45110

LibreCat | Files available | DOI

[59]

2023 | Book (Editor) | LibreCat-ID: 45191

Gräßler, I., Maier, G. W., Steffen, E., & Roesmann, D. (Eds.). (2023). The Digital Twin of Humans. Springer International Publishing. https://doi.org/10.1007/978-3-031-26104-6

LibreCat | DOI

[58]

2022 | Journal Article | LibreCat-ID: 33741

Cappello, C., & Steffen, E. (2022). Symmetric Set Coloring of Signed Graphs. Annals of Combinatorics. https://doi.org/10.1007/s00026-022-00593-4

LibreCat | DOI | arXiv

[57]

2022 | Journal Article | LibreCat-ID: 31543

LibreCat | DOI | arXiv

[56]

2022 | Journal Article | LibreCat-ID: 33950

Cappello, C., & Steffen, E. (2022). Frustration-critical signed graphs. Discrete Applied Mathematics, 322, 183–193. https://doi.org/10.1016/j.dam.2022.08.010

LibreCat | DOI | arXiv

[55]

2022 | Journal Article | LibreCat-ID: 26408

Mattiolo, D., & Steffen, E. (2022). Edge colorings and circular flows on regular graphs. Journal of Graph Theory, 99(3), 399–413. https://doi.org/10.1002/jgt.22746

LibreCat | DOI | arXiv

[54]

2021 | Conference Paper | LibreCat-ID: 22287

LibreCat | DOI

[53]

2021 | Journal Article | LibreCat-ID: 23456

Mattiolo, D., & Steffen, E. (2021). Highly edge‐connected regular graphs without large factorizable subgraphs. Journal of Graph Theory, 99(1), 107–116. https://doi.org/10.1002/jgt.22729

LibreCat | DOI | arXiv

[52]

2021 | Journal Article | LibreCat-ID: 21827

Klopp, A., & Steffen, E. (2021). Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs. Graphs and Combinatorics, 559–580. https://doi.org/10.1007/s00373-020-02266-6

LibreCat | DOI | arXiv

[51]

2021 | Journal Article | LibreCat-ID: 13445

Steffen, E., & Vogel, A. (2021). Concepts of signed graph coloring. European J. Combinatorics, 91.

LibreCat | arXiv

[50]

2020 | Journal Article | LibreCat-ID: 13114

Lu, Y., Luo, R., Schubert, M., Steffen, E., & Zhang, C.-Q. (2020). Flows on signed graphs without long barbells. SIAM J. Discrete Math, 34 (4), 2166–2187. https://doi.org/10.1137/18M1222818

LibreCat | DOI | arXiv

[49]

2020 | Journal Article | LibreCat-ID: 12971

Jin, L., & Steffen, E. (2020). Unions of 1-factors in r-graphs and overfull graphs. J. of Combinatorics, 11, 457–473.

LibreCat | arXiv

[48]

2018 | Book Chapter | LibreCat-ID: 16938

LibreCat | DOI

[47]

2018 | Journal Article | LibreCat-ID: 10129

Fiol, M. A., Mazzuoccolo, G., & Steffen, E. (2018). Measures of Edge-Uncolorability of Cubic Graphs. The Electronic Journal of Combinatorics, 25(4).

LibreCat

[46]

2018 | Journal Article | LibreCat-ID: 10130

Rollová, E., Schubert, M., & Steffen, E. (2018). Flows in Signed Graphs with Two Negative Edges . The Electronic Journal of Combinatorics, 25(2). https://doi.org/10.37236/4458

LibreCat | DOI

[45]

2018 | Journal Article | LibreCat-ID: 10132

Jin, L., Mazzuoccolo, G., & Steffen, E. (2018). Cores, joins and the Fano-flow conjectures. Discussiones Mathematicae Graph Theory, 38, 165–175. https://doi.org/10.7151/dmgt.1999

LibreCat | DOI

[44]

2018 | Journal Article | LibreCat-ID: 10142

Steffen, E. (2018). Approximating Vizing’s independence number conjecture. Australasian Journal of Combinatorics, 71(1), 153–160.

LibreCat

[43]

2017 | Book (Editor) | LibreCat-ID: 10146

Maier, G. W., Engels, G., & Steffen, E. (Eds.). (2017). Handbuch Gestaltung digitaler und vernetzter Arbeitswelten (1st ed.). Springer Berlin Heidelberg.

LibreCat

[42]

2017 | Book Chapter | LibreCat-ID: 10147

LibreCat

[41]

2017 | Journal Article | LibreCat-ID: 10155

Mazzuoccolo, G., & Steffen, E. (2017). Nowhere-zero 5-flows on cubic graphs with oddness 4. J. Graph Theory, 85, 363 – 371.

LibreCat

[40]

2017 | Journal Article | LibreCat-ID: 10156

Bej, S., & Steffen, E. (2017). Factors of edge-chromatic critical graphs: a brief survey and some equivalences. Lecture Notes of Seminario Interdisciplinare Di Matematica, 14, 37–48.

LibreCat

[39]

2017 | Journal Article | LibreCat-ID: 10157

Jin, L., & Steffen, E. (2017). Petersen cores and the oddness of cubic graphs. J. Graph Theory, 84, 109–120.

LibreCat

[38]

2016 | Journal Article | LibreCat-ID: 10158

Jin, L., Kang, Y., & Steffen, E. (2016). Face-degree bounds for planar critical graphs. Electronic Journal of Combinatorics, 23(3).

LibreCat

[37]

2016 | Journal Article | LibreCat-ID: 10159

Kang, Y., & Steffen, E. (2016). The chromatic spectrum of signed graphs. Discrete Mathematics , 339, 234–243.

LibreCat

[36]

2016 | Journal Article | LibreCat-ID: 10160

Jin, L., Kang, Y., & Steffen, E. (2016). Remarks on planar critical graphs. Discrete Applied Mathematics, 200, 200–202.

LibreCat

[35]

2016 | Journal Article | LibreCat-ID: 10161

Jin, L., Kang, Y., & Steffen, E. (2016). Choosability in signed planar graphs. European J. Combinatorics, 52, 234–243.

LibreCat

[34]

2015 | Journal Article | LibreCat-ID: 10162

Steffen, E. (2015). Intersecting 1-factors and nowhere-zero 5-flows. Combinatorica, 35, 633–640.

LibreCat

[33]

2015 | Journal Article | LibreCat-ID: 10163

Steffen, E. (2015). Edge-colorings and circular flow numbers of regular graphs. J. Graph Theory, 79, 1–7.

LibreCat

[32]

2015 | Journal Article | LibreCat-ID: 10164

Máčajová, E., & Steffen, E. (2015). The difference between the circular and the integer flow number of bidirected graphs. Discrete Mathematics, 338, 866–867.

LibreCat

[31]

2015 | Journal Article | LibreCat-ID: 10165

Steffen, E. (2015). 1-factor-and cycle covers of cubic graphs. J. Graph Theory, 78(3), 195 – 206.

LibreCat

[30]

2015 | Journal Article | LibreCat-ID: 10166

Schubert, M., & Steffen, E. (2015). Nowhere-zero flows on signed regular graphs. European J. Combinatorics, 48, 34–47.

LibreCat

[29]

2014 | Journal Article | LibreCat-ID: 10167

Schubert, M., & Steffen, E. (2014). The set of circular flow numbers of regular graphs. J. Graph Theory, 76, 297–308.

LibreCat

[28]

2014 | Journal Article | LibreCat-ID: 10169

Hägglund, J., & Steffen, E. (2014). Petersen colorings and some families of snarks. Ars Mathematica Contemporanea, 312, 476–478.

LibreCat

[27]

2012 | Journal Article | LibreCat-ID: 10170

LibreCat

[26]

2012 | Journal Article | LibreCat-ID: 10171

Steffen, E. (2012). Nearly nowhere-zero r-flow graphs. Discrete Mathematics, 312, 2757–2759.

LibreCat

[25]

2012 | Journal Article | LibreCat-ID: 10172

Mkrtchyan, V., & Steffen, E. (2012). Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory, 70, 473–482.

LibreCat

[24]

2012 | Journal Article | LibreCat-ID: 10173

Mkrtchyan, V., & Steffen, E. (2012). Measures of edge-uncolorability. Discrete Mathematics, 312, 476–478.

LibreCat

[23]

2010 | Journal Article | LibreCat-ID: 10174

Steffen, E. (2010). Tutte’s 5-flow conjecture for cyclically highly connected cubic graphs. Discrete Mathematics, 310, 385–389.

LibreCat

[22]

2010 | Preprint | LibreCat-ID: 10202

Mkrtchyan, V., & Steffen, E. (2010). Bricks and conjectures of Berge, Fulkerson and Seymour. ArXiv:1003.5782.

LibreCat

[21]

2008 | Journal Article | LibreCat-ID: 10175

Mohar, B., Steffen, E., & Vodopivec, A. (2008). Relating embedding and coloring properties of snarks. Ars Mathematica Contemporanea, 1, 169–184.

LibreCat

[20]

2006 | Journal Article | LibreCat-ID: 10176

Boben, M., Pisanski, T., Ravnik, N., & Steffen, E. (2006). Erratum to „Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 154(11), 1645–1646.

LibreCat

[19]

2004 | Journal Article | LibreCat-ID: 10177

Steffen, E. (2004). Measurements of edge-uncolorability. Discrete Mathematics, 280, 191–214.

LibreCat

[18]

2004 | Journal Article | LibreCat-ID: 10178

Grünewald, S., & Steffen, E. (2004). Independent Sets and 2-factors in edge-chromatic critical graphs. J. Graph Theory, 45, 113–118.

LibreCat

[17]

2001 | Journal Article | LibreCat-ID: 10179

Steffen, E. (2001). Circular flow numbers of regular multigraphs. J. Graph Theory, 36, 24–34.

LibreCat

[16]

2001 | Journal Article | LibreCat-ID: 10180

Steffen, E. (2001). On bicritical snarks. Math. Slovaca, 51, 141–150.

LibreCat

[15]

2000 | Journal Article | LibreCat-ID: 10182

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.

LibreCat

[14]

2000 | Journal Article | LibreCat-ID: 10183

Steffen, E. (2000). A refinement of Vizing’s theorem. Discrete Mathematics, 218, 289–291.

LibreCat

[13]

2000 | Journal Article | LibreCat-ID: 10186

Carstens, H. G., Dinski, T., & Steffen, E. (2000). Reductions of Symmetry configurations n3. Discrete Applied Mathematics, 99, 401–411.

LibreCat

[12]

1999 | Journal Article | LibreCat-ID: 10187

Steffen, E. (1999). Counterexamples to a conjecture about Petersen-minors in supersnarks. Discrete Mathematics, 207, 291–292.

LibreCat

[11]

1999 | Journal Article | LibreCat-ID: 10189

Steffen, E. (1999). Non-bicritical critical snarks. Graphs Comb., 15, 473–480.

LibreCat

[10]

1999 | Journal Article | LibreCat-ID: 10190

Grünewald, S., & Steffen, E. (1999). Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory, 19, 5–11.

LibreCat

[9]

1999 | Journal Article | LibreCat-ID: 10191

Grünewald, S., & Steffen, E. (1999). Chromatic-index-critical graphs of even order. J. Graph Theory, 30, 27–36.

LibreCat

[8]

1998 | Journal Article | LibreCat-ID: 10193

Brinkmann, G., & Steffen, E. (1998). Snarks and reducibility. Ars Combinatoria, 50, 292–296.

LibreCat

[7]

1998 | Journal Article | LibreCat-ID: 10194

Brinkmann, G., & Steffen, E. (1998). Chromatic-index-critical graphs of Orders 11 and 12. European J. Combinatorics, 19, 889–900.

LibreCat

[6]

1998 | Journal Article | LibreCat-ID: 10195

Steffen, E. (1998). Classification and characterizations of snarkse. Discrete Mathematics, 188, 183-203 (.

LibreCat

[5]

1997 | Journal Article | LibreCat-ID: 10196

Brinkmann, G., & Steffen, E. (1997). 3- and 4-critical graphs of small even order. Discrete Mathematics, 188, 193–197.

LibreCat

[4]

1996 | Journal Article | LibreCat-ID: 10197

Steffen, E. (1996). Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discrete Mathematics, 161, 315.

LibreCat

[3]

1996 | Journal Article | LibreCat-ID: 10198

Steffen, E., & Zhu, X. (1996). Star chromatic numbers of graphs. Combinatorica, 16, 439–448.

LibreCat

[2]

1996 | Journal Article | LibreCat-ID: 10199

Steffen, E. (1996). Tutte’s 5-flow conjecture for graphs of non-orientable genus 5. J. Graph Theory, 22, 309–319.

LibreCat

[1]

1992 | Conference Paper | LibreCat-ID: 10201

Steffen, E. (1992). Complexity results for the default- and autoepistemic logic. In E. Börger (Ed.), Computer Science Logic (Vol. 626, pp. 339–352). Springer Berlin Heidelberg.

LibreCat

Eckhard Steffen

69 Publications

Search

Filter Publications

Display / Sort

Export / Embed

69 Publications

Search

Filter Publications

Display / Sort

Export / Embed

Eckhard Steffen

69 Publications

Search

Filter Publications

Display / Sort

Export / Embed

Export Options

69 Publications

Search

Filter Publications

Display / Sort

Export / Embed

Export Options