A recolouring problem on undirected graphs

MaRDI QIDQ5483561zbMATH OpenFDO

Authors Thomas Kalinowski

Publication date 15 August 2006

Full work available at URL http://ftp.math.uni-rostock.de/pub/romako/heft58/kali58.pdf

zbMATH Keywords

2-colouringrecolouring algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Evolutionary graph colouring
• scientific article; zbMATH DE number 4099379
• A Random Recolouring Method for Graphs and Hypergraphs
• A reconfigurations analogue of Brooks' theorem
• scientific article; zbMATH DE number 4210190

Cited in

(2)

• Evolutionary graph colouring
• Recoloring the colored de Bruijn graph

This page was built for publication: A recolouring problem on undirected graphs

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