The following pages link to The b-chromatic number of a graph (Q1283791):
Displaying 50 items.
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- On approximating the b-chromatic number (Q1765381) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- A note on approximating the \(b\)-chromatic number (Q1949121) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- \(b\)-chromatic number of Cartesian product of some families of graphs (Q2014703) (← links)
- \(b\)-coloring of the Mycielskian of some classes of graphs (Q2118233) (← links)
- Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- New Steiner 2-designs from old ones by paramodifications (Q2208353) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
- On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
- On the \(b\)-coloring of \(G - e\) (Q2345629) (← links)
- Graphs of girth at least 7 have high \(b\)-chromatic number (Q2346588) (← links)
- The \(b\)-chromatic index of graphs (Q2352073) (← links)
- The \(b\)-chromatic index of direct product of graphs (Q2352788) (← links)
- On the \(b\)-chromatic number of regular bounded graphs (Q2355753) (← links)
- On the \(b\)-continuity property of graphs (Q2381540) (← links)
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity (Q2413181) (← links)
- \(b\)-chromatic sum of Mycielskian of paths (Q2413392) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725) (← links)
- \(b\)-chromatic numbers of powers of paths and cycles (Q2444545) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
- On the \(b\)-dominating coloring of graphs (Q2576347) (← links)
- On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
- \(b\)-chromatic sum of a graph (Q2788715) (← links)
- Certain chromatic sums of some cycle-related graph classes (Q2821116) (← links)
- \(B\)-coloring of \(m\)-tight graphs (Q2840540) (← links)
- \(B\)-chromatic number of cacti (Q2840549) (← links)
- On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743) (← links)
- Bounds for the \(b\)-chromatic number of vertex-deleted subgraphs and the extremal graphs (Q2851488) (← links)
- The b-Chromatic Number of Some Standard Graphs (Q3296845) (← links)
- The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
- About the b-continuity of graphs (Q3439146) (← links)
- On b-vertex and b-edge critical graphs (Q3459012) (← links)
- Exact values for the<i>b</i>-chromatic number of a power complete<i>k</i>-ary tree (Q4678480) (← links)
- Generalised colouring sums of graphs (Q4966732) (← links)
- Achromatic numbers of Kneser graphs (Q5013343) (← links)
- The study of the b-choromatic number of some classes of fractal graphs (Q5043910) (← links)
- A Note on<i>b-</i>Coloring of Fan Graphs (Q5069654) (← links)
- The<i>b</i>-chromatic number of certain graphs and digraphs (Q5069792) (← links)
