The following pages link to (Q4414507):
Displaying 35 items.
- 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)
- 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 number of \(B\)-flows of a graph (Q2509755) (← 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)
- \(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)
- On the bichromatic <i>k</i> -set problem (Q2930344) (← links)
- About the b-continuity of graphs (Q3439146) (← links)
- On b-vertex and b-edge critical graphs (Q3459012) (← links)
- (Q4584199) (← links)
- A Note on<i>b-</i>Coloring of Fan Graphs (Q5069654) (← links)
- (Q5071864) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)
- (Q5360943) (← links)
- (Q5443201) (← links)
- Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5915813) (← links)
- Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)
