2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2017
Remarks on planar edge-chromatic critical graphs
Ligang Jin, Yingli Kang, Eckhard Steffen
The only open case of Vizing's conjecture that every planar graph with is a class 1 graph is . We give a short proof of the following statement: there is no 6-criti…
math.CO2017★ 2 cited
On measures of edge-uncolorability of cubic graphs: A brief survey and some new results
M. A. Fiol, G. Mazzuoccolo, E. Steffen
There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for c…
math.CO2016
Signed graphs with two negative edges
Edita Rollová, Michael Schubert, Eckhard Steffen
The presented paper studies the flow number of flow-admissible signed graphs with two negative edges. We restrict our study to cubic graphs, because for each non-c…