On quasi-monotonous graphs

DOI10.1016/j.dam.2015.06.001zbMath1327.05112OpenAlexW758833724MaRDI QIDQ897599

Mekkia Kouider

Publication date: 7 December 2015

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

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

zbMATH Keywords

chordal graphsclaw-free graphs\(b\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On Grundy and b-chromatic number of some families of graphs: a comparative study ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ A characterization of edge \(b\)-critical graphs ⋮ Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs ⋮ New bounds for the \(b\)-chromatic number of vertex deleted graphs ⋮ On the b-coloring of tight graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The b-chromatic number of cubic graphs
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• On variations of \(P_{4}\)-sparse graphs
• On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
• On the \(b\)-chromatic number of regular graphs
• On the \(b\)-chromatic number of regular bounded graphs
• On the \(b\)-dominating coloring of graphs
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
• A Characterization of b-Perfect Graphs

This page was built for publication: On quasi-monotonous graphs