b-coloring of Cartesian product of trees
From MaRDI portal
Publication:514975
DOI10.11650/TJM.20.2016.5062zbMATH Open1357.05034OpenAlexW2271267980MaRDI QIDQ514975FDOQ514975
Authors: R. Balakrishnan, S. Francis Raj, T. Kavaskar
Publication date: 9 March 2017
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm.20.2016.5062
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 Cartesian product of odd graphs.
- \(b\)-coloring of the Mycielskian of some classes of graphs
- \(b\)-chromatic number of Cartesian product of some families of graphs
- The general position number of the Cartesian product of two trees
- \(b\)-colouring the Cartesian product of trees and some other graphs
- A two-coloring of Cartesian products
- The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
- On the \(b\)-continuity of the lexicographic product of graphs
- Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas
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)