On minimally \(b\)-imperfect graphs

DOI10.1016/j.dam.2009.02.023zbMath1227.05144OpenAlexW2108792210MaRDI QIDQ967413

Frédéric Maffray, Chính T. Hoàng, Cláudia Linhares Sales

Publication date: 28 April 2010

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

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

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic numbercoloration\(a\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs ⋮ A Characterization of b-Perfect Graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ On the \(b\)-coloring of \(P_{4}\)-tidy graphs ⋮ A characterization of edge \(b\)-critical graphs ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ A characterization of claw-free \(b\)-perfect graphs ⋮ \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ⋮ On the b-coloring of cographs and \(P_{4}\)-sparse graphs ⋮ On b-perfect chordal graphs

Cites Work

• Dominating cliques in \(P_ 5\)-free graphs
• The b-chromatic number of a graph
• Some bounds for the \(b\)-chromatic number of a graph
• Bounds for the b-chromatic number of some families of graphs
• On the \(b\)-dominating coloring of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item