2 papers
math.CO2026
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…
math.CO2025
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…