Gray code numbers for graphs

DOI10.26493/1855-3974.196.0dfzbMath1236.05078OpenAlexW1930124199WikidataQ129352733 ScholiaQ129352733MaRDI QIDQ3119064

Kelly Choo, Gary MacGillivray

Publication date: 7 March 2012

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.196.0df

zbMATH Keywords

graph colouringcyclic Gray code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Classifying coloring graphs ⋮ Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ Reconfiguring dominating sets in some well-covered and other classes of graphs ⋮ Reconfiguration graphs of shortest paths ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ Reconfiguration graphs of zero forcing sets ⋮ Cut-colorings in coloring graphs ⋮ Recolouring reflexive digraphs ⋮ The \(k\)-dominating graph ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Reconfiguration graphs for dominating sets ⋮ Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs ⋮ Introduction to reconfiguration ⋮ Hamilton paths in dominating graphs of trees and cycles

This page was built for publication: Gray code numbers for graphs