Some bounds for the \(b\)-chromatic number of a graph
From MaRDI portal
Publication:1849931
DOI10.1016/S0012-365X(01)00469-1zbMath1008.05056MaRDI QIDQ1849931
Mekkia Kouider, Maryvonne Maheo
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (47)
The study of the b-choromatic number of some classes of fractal graphs ⋮ Thinness of product graphs ⋮ On b-vertex and b-edge critical graphs ⋮ The \(b\)-chromatic number of powers of hypercube ⋮ A Note onb-Coloring of Fan Graphs ⋮ Theb-chromatic number of certain graphs and digraphs ⋮ Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs ⋮ On Grundy and b-chromatic number of some families of graphs: a comparative study ⋮ The b-chromatic number of cubic graphs ⋮ Bounds for the \(b\)-chromatic number of \(G-v\) ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ About \(b\)-coloring of windmill graph ⋮ On \(b\)-chromatic number of Sun let graph and wheel graph families ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ Edge-\(b\)-coloring trees ⋮ Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement ⋮ On the \(b\)-chromatic number of Cartesian products ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ A characterization of claw-free \(b\)-perfect graphs ⋮ On \(b\)-chromatic number with other types of chromatic numbers on double star graphs ⋮ The b-Chromatic Number of Some Standard Graphs ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ On \(b\)-coloring of powers of hypercubes ⋮ On minimally \(b\)-imperfect graphs ⋮ On the b-chromatic number of Kneser graphs ⋮ Unnamed Item ⋮ On approximating the b-chromatic number ⋮ Recolouring-resistant colourings ⋮ Bounds for the b-chromatic number of some families of graphs ⋮ \(b\)-chromatic number of Cartesian product of some families of graphs ⋮ Exact values for theb-chromatic number of a power completek-ary tree ⋮ On the \(b\)-chromatic number of regular graphs ⋮ \([r,s,t\)-colorings of graph products] ⋮ The b-chromatic number of power graphs of complete caterpillars ⋮ Generalised colouring sums of graphs ⋮ The \(b\)-chromatic index of a graph ⋮ On \(b\)-colorings in regular graphs ⋮ \(b\)-coloring of Kneser graphs ⋮ On lower bounds for the b-chromatic number of connected bipartite graphs ⋮ A graph b-coloring framework for data clustering ⋮ On b-perfect chordal graphs ⋮ On \(b\)-coloring of the Kneser graphs ⋮ Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs ⋮ About the b-continuity of graphs ⋮ The \(b\)-chromatic index of direct product of graphs ⋮ \(b\)-coloring of the Mycielskian of some classes of graphs
This page was built for publication: Some bounds for the \(b\)-chromatic number of a graph
