b-Chromatic sum of a graph

DOI10.1142/S1793830915500408zbMath1331.05080MaRDI QIDQ2788715

M. S. Sunitha, P. C. Lisna

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

pathscycles\(b\)-chromatic number\(b\)-chromatic sumcorona of cyclescorona of paths

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Optimal channel assignment and \(L(p,1)\)-labeling ⋮ Coloring Sums of Extensions of Certain Graphs ⋮ \(b\)-chromatic sum of Mycielskian of paths ⋮ Minimum 2-distance coloring of planar graphs and channel assignment ⋮ Generalised colouring sums of graphs ⋮ Certain chromatic sums of some cycle-related graph classes

Cites Work

• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• On \(b\)-coloring of the Kneser graphs
• On the \(b\)-chromatic number of regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: b-Chromatic sum of a graph