Solving the b-coloring problem for subdivision-edge neighborhood coronas
From MaRDI portal
Publication:6551192
Recommendations
Cites work
- \(b\)-chromatic number of Cartesian product of some families of graphs
- \(b\)-coloring of Cartesian product of trees
- b-colouring the Cartesian product of trees and some other graphs
- Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets
- b-coloring of Cartesian product of odd graphs.
- Normalized Laplacian spectrum of some subdivision-coronas of two regular graphs
- On b-coloring of Cartesian product of graphs.
- On the b-chromatic number of Cartesian products
- On the \(b\)-continuity of the lexicographic product of graphs
- On the b-chromatic number of some graph products
- On two conjectures on b-coloring of graph products
- Some bounds for the b-chromatic number of a graph
- Spectra of graphs resulting from various graph operations and products: a survey
- Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
- The \(b\)-chromatic index of direct product of graphs
- The b-chromatic number and related topics -- a survey
- The b-chromatic number of corona graphs
- The b-coloring and b-continuity of the cartesian product of some graphs
- The b -chromatic number of the cartesian product of two graphs
- The b-chromatic number of a graph
This page was built for publication: Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551192)