43 citations · 166 across the 37 of their papers we have counts for
Showing 2023 · math.COShow all
3 papers · 2 filters
math.CO2023
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…
math.CO2023
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…
math.CO2023
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…