The following pages link to The b-chromatic number of a graph (Q1283791):
Displaying 16 items.
- (Q5071864) (← links)
- (Q5071875) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- A note on fall colorings of Kneser graphs (Q5135733) (← links)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)
- (Q5360943) (← links)
- B-chromatic number: Beyond NP-hardness (Q5363791) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- On b-coloring of central graph of some graphs (Q5865894) (← links)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← 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)
- Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas (Q6551192) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)
- On neighborhood \(b\)-pseudo chromatic number of graphs (Q6650652) (← links)
