Bounds for the b-chromatic number of subgraphs and edge-deleted subgraphs
From MaRDI portal
(Redirected from Publication:339486)
Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
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
- scientific article; zbMATH DE number 1953103 (Why is no real title available?)
- scientific article; zbMATH DE number 1919512 (Why is no real title available?)
- About the b-continuity of graphs
- Bounds for the b-chromatic number of G-v
- Bounds for the b-chromatic number of some families of graphs
- On approximating the b-chromatic number
- On the \(b\)-continuity property of graphs
- On the \(b\)-dominating coloring of graphs
- Some bounds for the b-chromatic number of a graph
- The b-chromatic number of a graph
- The b-chromatic number of cubic graphs
- b-coloring of some bipartite graphs
- \(b\)-colouring outerplanar graphs with large girth
Cited in
(5)
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)