The b-chromatic number of certain graphs and digraphs
DOI10.1080/09720529.2016.1160512zbMATH Open1495.05098arXiv1511.00680OpenAlexW2963488730MaRDI QIDQ5069792FDOQ5069792
Authors: Johan Kok, N. K. Sudev
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00680
Recommendations
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (25)
- The \(b\)-chromatic number of regular graphs via the edge-connectivity
- Title not available (Why is that?)
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs
- The \(b\)-chromatic number and related topics -- a survey
- 几类Corona图的$b$-染色数
- \(b\)-chromatic number of complement of some graphs
- The b-chromatic number of power graphs of complete caterpillars
- Title not available (Why is that?)
- On \(b\)-chromatic number for a certain triangular line graphs
- On b-perfect chordal graphs
- The b-chromatic number of cubic graphs
- On the \(b\)-chromatic number of some graphs
- The \(b\)-chromatic number of ladder graph
- Burling graphs, chromatic number, and orthogonal tree-decompositions
- About \(b\)-coloring of windmill graph
- On \(b\)-chromatic number of Sun let graph and wheel graph families
- Chromatic number of some families of graphs
- Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
- Generalised colouring sums of graphs
- \(B\)-chromatic number of cacti
- Title not available (Why is that?)
- \(b\)-chromatic sum of a graph
- Rainbow neighbourhood number of graphs
- On the upper and lower chromatic numbers of BSQSs(16)
- Hybrid evolutionary algorithm for the b-chromatic number
This page was built for publication: The \(b\)-chromatic number of certain graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069792)