Recolouring-resistant colourings

DOI10.1016/J.DAM.2011.02.002zbMATH Open1218.05053OpenAlexW2089378418MaRDI QIDQ548277FDOQ548277

Dieter Rautenbach, Anders Sune Pedersen

Publication date: 28 June 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.02.002

Recommendations

• Fixing improper colorings of graphs
• Fixing improper colorings of graphs
• scientific article
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• A reconfigurations analogue of Brooks' theorem

zbMATH Keywords

graph colouringb-chromatic numberb-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some simplified NP-complete graph problems
• The b-chromatic number of a graph
• Title not available (Why is that?)
• The b-chromatic number of cubic graphs
• Some bounds for the \(b\)-chromatic number of a graph
• On approximating the b-chromatic number
• Bounds for the b-chromatic number of some families of graphs
• On \(b\)-colorings in regular graphs
• \(B\)-chromatic number of cacti
• On b-perfect chordal graphs

Cited In (2)

• The \(b\)-chromatic number and related topics -- a survey
• More results on the \(z\)-chromatic number of graphs

This page was built for publication: Recolouring-resistant colourings

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