Bounds for the b-chromatic number of subgraphs and edge-deleted subgraphs
From MaRDI portal
Publication:339486
DOI10.7151/DMGT.1913zbMATH Open1350.05035OpenAlexW2482257018MaRDI QIDQ339486FDOQ339486
Publication date: 11 November 2016
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1913
Recommendations
- New bounds for the \(b\)-chromatic number of vertex deleted graphs
- Bounds for the \(b\)-chromatic number of induced subgraphs and \(G - e\)
- Some bounds for the \(b\)-chromatic number of a graph
- Bounds for the b-chromatic number of some families of graphs
- Bounds for the chromatic number of a graph
- Bounds for the \(b\)-chromatic number of \(G-v\)
- Upper bounds on the \(b\)-chromatic number and results for restricted graph classes
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- scientific article; zbMATH DE number 1779951
- On the \(b\)-chromatic number of regular bounded graphs
Cites Work
- The b-chromatic number of a graph
- On the \(b\)-continuity property of graphs
- \(b\)-coloring of some bipartite graphs
- Bounds for the \(b\)-chromatic number of \(G-v\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The b-chromatic number of cubic graphs
- Some bounds for the \(b\)-chromatic number of a graph
- About the b-continuity of graphs
- On approximating the b-chromatic number
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- \(b\)-colouring outerplanar graphs with large girth
This page was built for publication: Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339486)