b-coloring of m-tight graphs

DOI10.1016/j.endm.2009.11.035zbMath1268.05084OpenAlexW2038387047MaRDI QIDQ2840540

Cláudia Linhares Sales, Leonardo Sampaio

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.035

zbMATH Keywords

graph coloring\(b\)-coloringprecoloring extension\(m\)-tight graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The \(b\)-chromatic number and related topics -- a survey ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ A note on approximating the \(b\)-chromatic number ⋮ Some results on the b-chromatic number in complementary prism graphs

Cites Work

• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• Bounds for the b-chromatic number of some families of graphs
• Precoloring Extension III: Classes of Perfect Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: b-coloring of m-tight graphs