On quasi-monotonous graphs
From MaRDI portal
Publication:897599
DOI10.1016/J.DAM.2015.06.001zbMATH Open1327.05112OpenAlexW758833724MaRDI QIDQ897599FDOQ897599
Authors: 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
Recommendations
Cites Work
- The b-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- A characterization of \(b\)-perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The b-chromatic number of cubic graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- On the \(b\)-chromatic number of regular bounded graphs
- On the \(b\)-dominating coloring of graphs
- On variations of \(P_{4}\)-sparse graphs
- Bounds for the \(b\)-chromatic number of vertex-deleted subgraphs and the extremal graphs
Cited In (10)
- New bounds for the \(b\)-chromatic number of vertex deleted graphs
- On quasifactorability in graphs
- On the typical structure of graphs in a monotone property
- Quasimonotone graphs
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
- Measures on monotone properties of graphs
- A characterization of edge \(b\)-critical graphs
- On the b-coloring of tight graphs
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- On Grundy and b-chromatic number of some families of graphs: a comparative study
This page was built for publication: On quasi-monotonous graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897599)
