A comparison of the Grundy and b-chromatic number of K₂,t-free graphs
From MaRDI portal
Publication:2689124
DOI10.1007/S00373-023-02613-3OpenAlexW4318241249MaRDI QIDQ2689124FDOQ2689124
Authors: Zoia Masih, Manouchehr Zaker 
Publication date: 9 March 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02613-3
Recommendations
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- Inequalities for the Grundy chromatic number of graphs
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- On the Grundy and \(b\)-chromatic numbers of a graph
- Discussion on the (partial)Grundy and b-chromatic numbers of graphs
Cites Work
- Graph theory
- The b-chromatic number of a graph
- A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
- Title not available (Why is that?)
- Results on the Grundy chromatic number of graphs
- Title not available (Why is that?)
- On-line and first fit colorings of graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- On approximating the b-chromatic number
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- On the Grundy and \(b\)-chromatic numbers of a graph
- On quasi-monotonous graphs
- An upper bound on the Ramsey numbers R(3,k)
- On Grundy and b-chromatic number of some families of graphs: a comparative study
- Induced Turán numbers
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
- Graphs with no induced \(K_{2,t}\)
Cited In (5)
- Title not available (Why is that?)
- Bounds for the chromatic number of some \(pK_2\)-free graphs
- Discussion on the (partial)Grundy and b-chromatic numbers of 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: A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689124)
