Pages that link to "Item:Q2434725"
From MaRDI portal
The following pages link to Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement (Q2434725):
Displaying 6 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743) (← links)
- \(b\)-coloring of some bipartite graphs (Q2906843) (← links)
- (Q3331258) (← links)