On \(b\)-colorings in regular graphs
From MaRDI portal
Publication:1026139
DOI10.1016/J.DAM.2009.01.007zbMath1173.05319OpenAlexW2065078803MaRDI QIDQ1026139
Zoham Zemir, Frédéric Maffray, Mostafa Blidia
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.01.007
Related Items (21)
Graphs with girth at least 8 are b-continuous ⋮ On b-vertex and b-edge critical graphs ⋮ The b-chromatic number of cubic graphs ⋮ \((N, p)\)-equitable \(b\)-coloring of graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ The \(b\)-chromatic number of regular graphs via the edge-connectivity ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ The \(b\)-continuity of graphs with large girth ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ Edge-\(b\)-coloring trees ⋮ A note on approximating the \(b\)-chromatic number ⋮ Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs ⋮ Unnamed Item ⋮ Recolouring-resistant colourings ⋮ On the \(b\)-chromatic number of regular graphs ⋮ \(b\)-coloring of Kneser graphs ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ Graphs of girth at least 7 have high \(b\)-chromatic number ⋮ On the \(b\)-chromatic number of regular bounded graphs
Cites Work
- 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
- On the \(b\)-dominating coloring of graphs
- Some properties of the Hoffman-Singleton graph
- The achromatic number of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On \(b\)-colorings in regular graphs
