Pages that link to "Item:Q1682893"
From MaRDI portal
The following pages link to The \(b\)-chromatic number and related topics -- a survey (Q1682893):
Displaying 14 items.
- A characterization of \(b_e\)-critical trees (Q1700040) (← links)
- A note on \(b\)-coloring of Kneser graphs (Q1730264) (← links)
- \(b\)-coloring of the Mycielskian of some classes of graphs (Q2118233) (← 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)
- New bounds for the \(b\)-chromatic number of vertex deleted graphs (Q2243141) (← links)
- An integer programming approach to b-coloring (Q2419584) (← 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)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)
- Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas (Q6551192) (← links)
- On \(b\)-greedy colourings and \(z\)-colourings (Q6633541) (← links)
- On neighborhood \(b\)-pseudo chromatic number of graphs (Q6650652) (← links)
