Recolouring reflexive digraphs
type: Item
instance of: scholarly article
title: Recolouring reflexive digraphs
zbMATH Open document ID: 1384.05083
author: Richard C. Brewster
author: J. B. Lee
author: Mark Siggers
published in: Discrete Mathematics
publication date: 2018-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6861863
zbMATH Keywords: homomorphisms
zbMATH Keywords: recolouring
zbMATH Keywords: reflexive digraphs
zbMATH Keywords: hom-graph
MaRDI profile type: Publication
full work available at URL: j.disc.2018.03.006
OpenAlex ID: W2795132661
cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
cites work: A dichotomy theorem for circular colouring reconfiguration
cites work: Extending precolourings of circular cliques
cites work: Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
cites work: Finding paths between 3-colorings
cites work: Gray code numbers for graphs
cites work: A polynomial-time algorithm for near-unanimity graphs
cites work: Reflexive digraphs with near unanimity polymorphisms
cites work: Homomorphism reconfiguration via homotopy
Wikidata QID: Q130046463
DOI: 10.1016/J.DISC.2018.03.006
description: scientific article; zbMATH DE number 6861863