The b -chromatic number of the cartesian product of two graphs

DOI10.1556/SScMath.44.2007.1.5zbMath1127.05040MaRDI QIDQ5435420

Mekkia Kouider, Maryvonne Maheo

Publication date: 14 January 2008

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

zbMATH Keywords

Cartesian product\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Thinness of product graphs ⋮ The b-chromatic number of cubic graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ On the \(b\)-chromatic number of regular graphs without 4-cycle ⋮ On the \(b\)-chromatic number of Cartesian products ⋮ \(b\)-chromatic numbers of powers of paths and cycles ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ \(b\)-chromatic number of Cartesian product of some families of graphs ⋮ On the \(b\)-chromatic number of regular graphs ⋮ The \(b\)-chromatic index of a graph ⋮ The \(b\)-chromatic index of direct product of graphs

This page was built for publication: The b -chromatic number of the cartesian product of two graphs