Gray code numbers for graphs

DOI10.26493/1855-3974.196.0DFMaRDI QIDQ3119064zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Reconfiguring k-colourings of complete bipartite graphs
• Reconfiguring vertex colourings of 2-trees
• scientific article; zbMATH DE number 706769
• scientific article; zbMATH DE number 637346
• Some classes of bipartite graphs induced by Gray codes

Cited in

(20)

• Reconfiguring vertex colourings of 2-trees
• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
• Cut-colorings in coloring graphs
• Gray code enumeration of plane straight-line graphs
• Classifying coloring graphs
• Recolouring reflexive digraphs
• Block symmetries in graph coloring reconfiguration systems
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Introduction to reconfiguration
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• Reconfiguration graphs of shortest paths
• Mixing homomorphisms, recolorings, and extending circular precolorings
• Reconfiguration graphs for dominating sets
• The \(k\)-dominating graph
• Gray coding cubic planar maps
• Lower against number in graphs
• Reconfiguring k-colourings of complete bipartite graphs
• Contrast in greyscales of graphs
• Reconfiguration graphs of zero forcing sets
• Hamilton paths in dominating graphs of trees and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119064)