On two conjectures on b-coloring of graph products

DOI10.1556/012.2017.54.1.1358MaRDI QIDQ4608372zbMATH OpenOpenAlexWikidataFDO

Authors S. Francis Raj, T. Kavaskar

Publication date 16 March 2018

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/012.2017.54.1.1358

zbMATH Keywords

strong productlexicographic product\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the b-chromatic number of some graph products
• \(b\)-chromatic number of Cartesian product of some families of graphs
• \(b\)-chromatic number of lexicographic product of some graphs
• On \(b\)-coloring of Cartesian product of graphs.
• The b -chromatic number of the cartesian product of two graphs

Cited in

(6)

• scientific article; zbMATH DE number 7295387 (Why is no real title available?)
• scientific article; zbMATH DE number 6277727 (Why is no real title available?)
• scientific article; zbMATH DE number 7746011 (Why is no real title available?)
• Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
• \(b\)-chromatic number of lexicographic product of some graphs
• Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas

This page was built for publication: On two conjectures on \(b\)-coloring of graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608372)