On the b-dominating coloring of graphs
The \(b\)-chromatic number \(\varphi(G)\) of a graph \(G\) is the largest number \(k\) such that vertices of \(G\) can be coloured with \(k\) colours satisfying the following property: for each \(i\), \(1 \leq i \leq k\), there exists a vertex \(x_i\) of colour \(i\) such that for each \(j \neq i\), \(1 \leq j \leq k\) there exists a vertex \(y_j\) of colour \(j\) adjacent to \(x_i\). A graph \(G\) is called \(b\)-perfect if \(\varphi(G) = \chi(G)\) for each induced subgraph \(H\) of \(G\). In this paper, a characterization of \(b\)-perfect bipartite graphs is given; it is proved that a bipartite graph is \(b\)-perfect if and only if it is \(P_5\)-free, \(3P_3\)-free and \((P_4+P_3)\)-free (where ``\(+\) stands for the union of graphs). Further, it is proved that if a graph is \(2K_2\)-free and \(\overline{P_5}\)-free, then it is \(b\)-perfect. Also, the characterization of \(b\)-perfect \(P_4\)-sparse graphs (that is, the graphs with the property that no subset on five vertices contains more than one \(P_4\) as an induced subgraph) is given: a \(P_4\)-sparse graph is \(b\)-perfect if and only if it is \(2K_4^-\)-free, \(3P_3\)-free and \((P_4 + P_3)\)-free (where \(K_4^-\) is the graph \(K_4\) without an edge).
- On some domination colorings of graphs
- On dominator colorings in graphs
- On \(b\)-colorings in regular graphs
- scientific article; zbMATH DE number 1953103
- On the b-coloring of tight graphs
- Some results on the \(b\)-colouring parameters of graphs
- On the b-chromatic number of some graphs
- Some new results on b-coloring of graphs
- Dominated colorings of graphs
- On \(b\)-coloring of the Kneser graphs
- On \(b\)-colorings in regular graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On b-perfect chordal graphs
- The b-chromatic number and related topics -- a survey
- Characterization of \(b\gamma\)-perfect graphs
- \(b\)-chromatic number of Cartesian product of some families of graphs
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- New bounds for the \(b\)-chromatic number of vertex deleted graphs
- On the \(b\)-chromatic number of regular graphs
- The \(b\)-chromatic index of direct product of graphs
- On the \(b\)-chromatic number of regular bounded graphs
- On some domination colorings of graphs
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
- Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
- A characterization of b-perfect graphs
- Bounds for the b-chromatic number of subgraphs and edge-deleted subgraphs
- On b-vertex and b-edge critical graphs
- Bounds for the b-chromatic number of G-v
- On the \(b\)-chromatic number of regular graphs without 4-cycle
- scientific article; zbMATH DE number 7034041 (Why is no real title available?)
- The b-chromatic number and f-chromatic vertex number of regular graphs
- On \(b\)-chromatic number with other types of chromatic numbers on double star graphs
- On global dominating -X-coloring of graphs
- A Note onb-Coloring of Fan Graphs
- Hybrid evolutionary algorithm for the b-chromatic number
- On b-coloring of central graph of some graphs
- The b-chromatic number of cubic graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- A characterization of claw-free \(b\)-perfect graphs
- On z-coloring and \(\mathrm{b}^\ast \)-coloring of graphs as improved variants of the b-coloring
- The \(b\)-chromatic index of a graph
- b-coloring of Kneser graphs
- About b-coloring of windmill graph
- On b-chromatic number of Sun let graph and wheel graph families
- On quasi-monotonous graphs
- On minimally \(b\)-imperfect graphs
- On the b-chromatic number of Kneser graphs
This page was built for publication: On the \(b\)-dominating coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576347)
