A. Kidner

collaborators

2 papers

math.CO2025

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor

Arnott Kidner, Eckhard Steffen, Weiqiang Yu

An $r$ -regular graph is an $r$ -graph, if every odd set of vertices is connected to its complement by at least $r$ edges. We prove for $r \in {4, 5}$ , every projective planar $r$ -g…

math.CO2025

A dichotomy theorem for $I^$ -switchable $H$ -colouring on $m$ -edge coloured graphs

Richard Brewster, Arnott Kidner, Gary MacGillivray

Let $G$ be a graph in which each edge is assigned one of the colours $1, 2, \dots, m$ , and let $I^$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ of $G$ with…

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor

A dichotomy theorem for I^-switchable H-colouring on m-edge coloured graphs

A dichotomy theorem for $I^$ -switchable $H$ -colouring on $m$ -edge coloured graphs