b-coloring of Cartesian product of trees

DOI10.11650/TJM.20.2016.5062MaRDI QIDQ514975zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treesCartesian product\(b\)-chromatic number\(b\)-continuity\(b\)-spectrum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

(10)

• \(b\)-coloring of the Mycielskian of some classes of graphs
• b-coloring of Cartesian product of odd graphs.
• Determining the b-chromatic number of subdivision-vertex neighbourhood coronas
• \(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
• On the \(b\)-continuity of the lexicographic product of graphs
• A two-coloring of Cartesian products
• The b-coloring and b-continuity of the cartesian product of some 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)