b-colouring the Cartesian product of trees and some other graphs

DOI10.1016/J.DAM.2011.06.019zbMATH Open1259.05065OpenAlexW2030946812MaRDI QIDQ1941393FDOQ1941393

Yanyan Li

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.019

zbMATH Keywords

treeexact algorithmCartesian product\(b\)-chromatic number\(b\)-colouring

Mathematics Subject Classification ID

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

Cited In (8)

• The \(b\)-chromatic number and related topics -- a survey
• A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
• Title not available (Why is that?)
• Graphs of girth at least 7 have high \(b\)-chromatic number
• \([r,s,t]\)-coloring of trees and bipartite graphs
• On the \(b\)-chromatic number of Cartesian products
• Some results on the b-chromatic number in complementary prism graphs
• Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas

This page was built for publication: \(b\)-colouring the Cartesian product of trees and some other graphs

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