Bounds for the \(b\)-chromatic number of \(G-v\)
From MaRDI portal
Publication:385136
DOI10.1016/j.dam.2011.08.022zbMath1277.05055OpenAlexW2273535957MaRDI QIDQ385136
S. Francis Raj, R. Balakrishnan
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.022
Related Items
A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs, Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs, The \(b\)-chromatic number and related topics -- a survey, On the \(b\)-chromatic number of regular graphs without 4-cycle, \(b\)-chromatic numbers of powers of paths and cycles, 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, \(b\)-chromatic number of Cartesian product of some families of graphs, The \(b\)-chromatic index of a graph, The \(b\)-chromatic index of direct product of graphs, On the \(b\)-chromatic number of regular bounded graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The b-chromatic number of cubic graphs
- Graph with given achromatic number
- The b-chromatic number of a graph
- On approximating the b-chromatic number
- Achromatic number is NP-complete for cographs and interval graphs
- 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
- About the b-continuity of graphs
- Achromatic numbers of random graphs
- The achromatic number of a graph