43 citations · 166 across the 37 of their papers we have counts for
37 papers
Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
Arnott Kidner, Eckhard Steffen, Weiqiang Yu
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. We prove for , every projective planar -g…
Some conjectures on -graphs and equivalences
Yulai Ma, Eckhard Steffen, Isaak H. Wolf +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Seymour [On multicolourings of cubic graphs, and conjecture…
Information dissemination and confusion in signed networks
Ligang Jin, Eckhard Steffen
We introduce a model of information dissemination in signed networks. It is a discrete-time process in which uninformed actors incrementally receive information from their informed…
Sets of -graphs that color all -graphs
Yulai Ma, Davide Mattiolo, Eckhard Steffen +1
An -regular graph is an -graph, if every odd set of vertices is connected to its complement by at least edges. Let and be -graphs. An -coloring of is a…
Rotation -graphs
Eckhard Steffen, Isaak H. Wolf
We study rotation -graphs and show that for every -graph of odd regularity there is a simple rotation -graph such that can be obtained form by a finite n…
Critically 3-frustrated signed graphs
Chiara Cappello, Reza Naserasr, Eckhard Steffen +1
Extending the notion of maxcut, the study of the frustration index of signed graphs is one of the basic questions in the theory of signed graphs. Recently two of the authors initia…