A new approach to b-coloring of regular graphs

Magda Dettlaff, Hanna Furmańczyk, Iztok Peterin, Adriana Roux and Radosław Ziemann

Applied Mathematics and Computation, 2024, vol. 481, issue C

Abstract: Let G be a graph and c:V(G)→{1,…,k} a proper k-coloring of G, i.e., c(u)≠c(v) for every edge uv from G. A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its closed neighborhood. The maximum number of colors k admitting b-coloring of G is the b-chromatic number χb(G).

Keywords: b-coloring; Regular graphs (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003758
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:481:y:2024:i:c:s0096300324003758

DOI: 10.1016/j.amc.2024.128914

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().