Characterization of b-perfect graphs

MaRDI QIDQ1928629zbMATH OpenFDO

Authors Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray

Publication date 3 January 2013

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

b-coloringGrundy coloringcomplete coloring\(a\)-coloring\(P_4\)-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A characterization of \(b\)-perfect graphs
• On the \(b\)-dominating coloring of graphs
• On minimally \(b\)-imperfect graphs
• On b-perfect chordal graphs
• Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs

Cited in

(8)

• The \(b\)-chromatic number and related topics -- a survey
• On minimally \(b\)-imperfect graphs
• Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
• On \(\omega\psi\)-perfect graphs.
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• A characterization of \(b\)-perfect graphs
• The Hadwiger number, chordal graphs and \(ab\)-perfection
• More results on the \(z\)-chromatic number of graphs

This page was built for publication: Characterization of \(b\gamma\)-perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928629)