On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (Q2840743)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6190276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lower bounds for the \(b\)-chromatic number of connected bipartite graphs |
scientific article; zbMATH DE number 6190276 |
Statements
23 July 2013
0 references
\(b\)-chromatic number
0 references
lower bounds
0 references
bipartite graphs
0 references
On lower bounds for the \(b\)-chromatic number of connected bipartite graphs (English)
0 references
0.879249632358551
0 references
0.848867654800415
0 references
0.837256669998169
0 references
0.8324766755104065
0 references
0.8252471685409546
0 references
