The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The b-chromatic number of regular graphs via the edge-connectivity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(b\)-chromatic number of regular graphs via the edge-connectivity |
scientific article |
Statements
The \(b\)-chromatic number of regular graphs via the edge-connectivity (English)
0 references
24 January 2014
0 references
\(b\)-coloring
0 references
\(b\)-chromatic number
0 references
edge-connectivity
0 references
super-edge-connected
0 references
0 references
0.94400513
0 references
0.93915904
0 references
0.9236054
0 references
0.91456187
0 references
0 references
0.90992576
0 references
