b-coloring of Cartesian product of trees
From MaRDI portal
Publication:514975
Recommendations
- b-coloring of Cartesian product of odd graphs.
- Some bounds for the \(b\)-chromatic number of a graph
- \(b\)-colouring the Cartesian product of trees and some other graphs
- The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
- \(b\)-chromatic number of Cartesian product of some families of graphs
Cited in
(9)- \(b\)-coloring of the Mycielskian of some classes of graphs
- \(b\)-colouring the Cartesian product of trees and some other graphs
- Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas
- The general position number of the Cartesian product of two trees
- The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
- On the \(b\)-continuity of the lexicographic product of graphs
- b-coloring of Cartesian product of odd graphs.
- \(b\)-chromatic number of Cartesian product of some families of graphs
- A two-coloring of Cartesian products
This page was built for publication: \(b\)-coloring of Cartesian product of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514975)