The following pages link to b-coloring of m-tight graphs (Q2840540):
Displaying 4 items.
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← 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)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)
