\((N, p)\)-equitable \(b\)-coloring of graphs

DOI10.1016/J.DAM.2017.09.004zbMath1375.05109OpenAlexW2761426135MaRDI QIDQ1682874

Hachem Slimani, Samiha Ait Taleb, Hamamache Kheddouci

Publication date: 6 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.09.004

zbMATH Keywords

\(b\)-coloring(arbitrary not) pivoted tree\((N, p)\)-equitable \(b\)-coloring\(p\)-equitable coloringequitable \(b\)-chromatic number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(r\)-equitable coloring of complete multipartite graphs
• A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
• Conflict-free star-access in parallel memory systems
• On \(b\)-colorings in regular graphs
• On \(b\)-coloring of the Kneser graphs
• The b-chromatic number of a graph
• On the \(b\)-chromatic number of regular graphs
• Bounds for the b-chromatic number of some families of graphs
• A note on r-equitable k-colorings of trees
• Equitable Coloring
• Multicriteria Optimization
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: \((N, p)\)-equitable \(b\)-coloring of graphs