2 papers
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…