The following pages link to The b-chromatic number of a graph (Q1283791):
Displayed 13 items.
- Fall colouring of bipartite graphs and Cartesian products of graphs (Q1003677) (← links)
- On \(b\)-colorings in regular graphs (Q1026139) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- On b-perfect chordal graphs (Q1043818) (← links)
- On \(b\)-coloring of the Kneser graphs (Q1043965) (← links)
- On approximating the b-chromatic number (Q1765381) (← links)
- On the \(b\)-continuity property of graphs (Q2381540) (← links)
- Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
- On the \(b\)-dominating coloring of graphs (Q2576347) (← links)
- The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
- About the b-continuity of graphs (Q3439146) (← links)
- Exact values for the<i>b</i>-chromatic number of a power complete<i>k</i>-ary tree (Q4678480) (← links)