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

DOI10.1016/J.DAM.2011.06.019zbMath1259.05065OpenAlexW2030946812MaRDI QIDQ1941393

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

treeCartesian productexact algorithm\(b\)-chromatic number\(b\)-colouring

Mathematics Subject Classification ID

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

Related Items (6)

A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ On the \(b\)-chromatic number of Cartesian products ⋮ Unnamed Item ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ Graphs of girth at least 7 have high \(b\)-chromatic number

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