Recolouring-resistant colourings

DOI10.1016/J.DAM.2011.02.002zbMath1218.05053OpenAlexW2089378418MaRDI QIDQ548277

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

zbMATH Keywords

graph colouringb-chromatic numberb-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

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

Cites Work

• Unnamed Item
• The b-chromatic number of cubic graphs
• On \(b\)-colorings in regular graphs
• On b-perfect chordal graphs
• Some simplified NP-complete graph problems
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• Some bounds for the \(b\)-chromatic number of a graph
• Bounds for the b-chromatic number of some families of graphs
• b-chromatic number of cacti

This page was built for publication: Recolouring-resistant colourings