A. Kidner

activity

20222025

(m, n)

-mixed graphs with switching is polynomial

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 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.CO2023

A dichotomy theorem for $Γ$ -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 $Γ$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ of $G$ with r…

math.CO2022★ 1 cited

The 2-colouring problem for $(m, n)$ -mixed graphs with switching is polynomial

Richard C Brewster, Arnott Kidner, Gary MacGillivray

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m, n)$ -mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose…

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

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs

The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial

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

The 2-colouring problem for $(m, n)$ -mixed graphs with switching is polynomial