The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs

DOI10.1016/j.dam.2014.07.011zbMath1303.05059arXiv1302.4214OpenAlexW2003480521MaRDI QIDQ477335

Mekkia Kouider, Maidoun Mortada, Amine El Sahili, Hamamache Kheddouci

Publication date: 3 December 2014

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

Full work available at URL: https://arxiv.org/abs/1302.4214

zbMATH Keywords

regular graphscoloring\(b\)-chromatic number\(f\)-chromatic vertex number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The \(b\)-chromatic number and related topics -- a survey ⋮ On the \(b\)-chromatic number of regular bounded graphs

Cites Work

• On the \(b\)-chromatic number of regular graphs without 4-cycle
• On \(b\)-colorings in regular graphs
• The b-chromatic number of a graph
• On approximating the b-chromatic number
• On the \(b\)-chromatic number of regular graphs
• On the \(b\)-chromatic number of regular bounded graphs
• On the \(b\)-dominating coloring of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs