A dichotomy theorem for $\Gamma$-switchable $H$-colouring on $m$-edge coloured graphs
From MaRDI portal
Publication:6439802
arXiv2306.05962MaRDI QIDQ6439802
Richard C. Brewster, Unnamed Author, Gary MacGillivray
Publication date: 9 June 2023
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: A dichotomy theorem for $\Gamma$-switchable $H$-colouring on $m$-edge coloured graphs