On the \(b\)-chromatic number of regular graphs

DOI10.1016/j.dam.2011.04.028zbMath1223.05063OpenAlexW2168539299MaRDI QIDQ2275938

Marko Jakovac, Sergio Cabello

Publication date: 10 August 2011

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

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

zbMATH Keywords

diametersizegirth\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ Graphs with girth at least 8 are b-continuous ⋮ On b-vertex and b-edge critical graphs ⋮ Coloring Sums of Extensions of Certain Graphs ⋮ \(b\)-chromatic sum of Mycielskian of paths ⋮ \((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 quasi-monotonous graphs ⋮ 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 ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ On the family of \(r\)-regular graphs with Grundy number \(r+1\) ⋮ The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular 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 ⋮ Unnamed Item ⋮ b-Chromatic sum of a graph ⋮ The \(b\)-chromatic index of a graph ⋮ Graphs of girth at least 7 have high \(b\)-chromatic number ⋮ The \(b\)-chromatic index of direct product of graphs ⋮ On the \(b\)-chromatic number of regular bounded graphs ⋮ \(b\)-coloring of the Mycielskian of some classes of graphs

Cites Work

• On the \(b\)-chromatic number of regular graphs without 4-cycle
• The b-chromatic number of cubic graphs
• On \(b\)-colorings in regular graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• On \(b\)-coloring of the Kneser graphs
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• Some bounds for the \(b\)-chromatic number of a graph
• On the \(b\)-continuity property of graphs
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
• On the b-chromatic number of some graph products
• The b-chromatic number of power graphs of complete caterpillars
• Exact values for theb-chromatic number of a power completek-ary tree
• The b -chromatic number of the cartesian product of two graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item