The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On \(b\)-colorings in regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the \(b\)-chromatic number of regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3565952 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The b-chromatic number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The b-chromatic number of cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On \(b\)-coloring of the Kneser graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4414507 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the \(b\)-chromatic number of regular graphs without 4-cycle / rank | |||
Normal rank | |||
Latest revision as of 07:14, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
