A Characterization of b-Perfect Graphs
From MaRDI portal
Publication:2911056
DOI10.1002/jgt.20635zbMath1248.05073OpenAlexW1904355337MaRDI QIDQ2911056
Meriem Mechebbek, Frédéric Maffray, Chính T. Hoàng
Publication date: 12 September 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20635
Related Items
A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs, List coloring in the absence of two subgraphs, The \(b\)-chromatic number and related topics -- a survey, Colouring of graphs with Ramsey-type forbidden subgraphs, On quasi-monotonous graphs, A characterization of edge \(b\)-critical graphs, A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs, Graphs with small fall-spectrum, The \(b\)-chromatic index of graphs
Cites Work
- Unnamed Item
- Weakly triangulated graphs
- The strong perfect graph theorem
- On the complexity of recognizing perfectly orderable graphs
- On minimally \(b\)-imperfect graphs
- On b-perfect chordal graphs
- On a property of the class of n-colorable graphs
- On the \(b\)-dominating coloring of graphs
- Improved algorithms for weakly chordal graphs