Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
From MaRDI portal
Publication:2851488
DOI10.1016/J.ENDM.2009.07.058zbMath1273.05078OpenAlexW2074437080MaRDI QIDQ2851488
R. Balakrishnan, S. Francis Raj
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.058
Related Items (9)
The b-chromatic number of cubic graphs ⋮ On quasi-monotonous graphs ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ New bounds for the \(b\)-chromatic number of vertex deleted graphs ⋮ On the b-coloring of tight graphs ⋮ On the \(b\)-chromatic number of regular graphs ⋮ \(b\)-coloring of Kneser graphs ⋮ On the \(b\)-coloring of \(G - e\)
Cites Work
This page was built for publication: Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs