Eckhard Steffen

From MaRDI portal
Person:311517

Available identifiers

zbMath Open steffen.eckhardMaRDI QIDQ311517

List of research outcomes





PublicationDate of PublicationType
Corrigendum to: ``Unions of 1-factors in \(r\)-graphs and overfull graphs2024-11-21Paper
Critically 3-frustrated signed graphs2024-11-09Paper
Edge-connectivity and pairwise disjoint perfect matchings in regular graphs2024-05-31Paper
Edge colorings and circular flows on regular graphs2023-10-05Paper
Highly edge‐connected regular graphs without large factorizable subgraphs2023-10-04Paper
Algorithms for the genome median under a restricted measure of rearrangement2023-09-19Paper
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs2023-08-10Paper
Symmetric set coloring of signed graphs2023-07-12Paper
Bounds for the chromatic index of signed multigraphs2023-06-15Paper
Sets of $r$-graphs that color all $r$-graphs2023-05-15Paper
Rotation $r$-graphs2023-04-25Paper
Critically 3-frustrated signed graphs2023-04-20Paper
Frustration-critical signed graphs2022-10-13Paper
Even factors in edge-chromatic-critical graphs with a small number of divalent vertices2022-06-01Paper
Fractional matchings, component-factors and edge-chromatic critical graphs2021-03-17Paper
Concepts of signed graph coloring2021-02-08Paper
Flows on Signed Graphs without Long Barbells2020-10-27Paper
Unions of 1-factors in \(r\)-graphs and overfull graphs2020-06-11Paper
Approximating Vizing's independence number conjecture2019-01-30Paper
Flows in signed graphs with two negative edges2018-06-14Paper
Circular coloring of signed graphs2018-02-23Paper
Cores, joins and the Fano-flow conjectures2018-01-10Paper
The difference between the circular and the integer flow number of bidirected graphs2017-09-28Paper
https://portal.mardi4nfdi.de/entity/Q53548462017-09-04Paper
Nowhere‐Zero 5‐Flows On Cubic Graphs with Oddness 42017-07-05Paper
Intersecting 1-factors and nowhere-zero 5-flows2017-03-31Paper
Petersen Cores and the Oddness of Cubic Graphs2017-02-01Paper
Nowhere-zero 5-flows2016-10-14Paper
Face-degree bounds for planar critical graphs2016-09-13Paper
The chromatic spectrum of signed graphs2016-07-05Paper
Remarks on planar edge-chromatic critical graphs2016-01-21Paper
Choosability in signed planar graphs2015-12-11Paper
Nowhere-zero flows on signed regular graphs2015-06-02Paper
Edge Colorings and Circular Flow Numbers of Regular Graphs2015-05-22Paper
1‐Factor and Cycle Covers of Cubic Graphs2015-03-24Paper
Petersen-colorings and some families of snarks2014-10-02Paper
The Set of Circular Flow Numbers of Regular Graphs2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q54200352014-06-11Paper
https://portal.mardi4nfdi.de/entity/Q54030212014-03-25Paper
Nearly nowhere-zero \(r\)-flow graphs2012-09-12Paper
Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs2012-08-31Paper
Measures of edge-uncolorability2012-01-11Paper
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs2010-03-29Paper
Relating embedding and coloring properties of snarks2009-01-09Paper
Tutte's 5-flow conjecture for highly cyclically connected cubic graphs2007-05-29Paper
Measurements of edge-uncolorability2004-08-06Paper
Independent sets and 2‐factors in edge‐chromatic‐critical graphs2004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45295512002-05-05Paper
Circular flow numbers of regular multigraphs2002-04-08Paper
Snarks and reducibility2001-06-10Paper
A refinement of Vizing's theorem2000-12-03Paper
Classification and characterizations of snarks2000-11-02Paper
Counterexamples to a conjecture about Petersen-minors in supersnarks2000-08-03Paper
Reduction of symmetric configurations \(n_3\)2000-07-05Paper
Bounds for the Independence Number of Critical Graphs2000-06-22Paper
Cyclically 5-edge connected non-bicritical critical snarks2000-02-14Paper
Chromatic-index-critical graphs of even order2000-02-02Paper
Non-bicritical critical snarks2000-01-30Paper
Chromatic-index-critical graphs of orders 11 and 121999-08-19Paper
3- and 4-critical graphs of small even order1997-06-16Paper
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs1997-06-09Paper
Tutte's 5-flow conjecture for graphs of nonorientable genus 51997-02-26Paper
Star chromatic numbers of graphs1996-12-16Paper
https://portal.mardi4nfdi.de/entity/Q42029561993-09-06Paper
https://portal.mardi4nfdi.de/entity/Q40032531992-09-18Paper
Edge-connectivity and pairwise disjoint perfect matchings in regular graphsN/APaper
On token signed graphsN/APaper

Research outcomes over time

This page was built for person: Eckhard Steffen