2 papers
math.CO2026
Colouring negative exact-distance graphs of signed graphs
Reza Naserasr, Patrice Ossona de Mendez, Daniel A. Quiroz +2
The -th exact-distance graph, of a graph has as its vertex set, and as an edge if and only if the distance between and is (exactly) in . We consid…
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…