The strong chromatic index of a cubic graph is at most 10 (Q1201255): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Induced matchings in bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Representatives of Subsets / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90678-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035019112 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strong chromatic index of a cubic graph is at most 10 |
scientific article |
Statements
The strong chromatic index of a cubic graph is at most 10 (English)
0 references
17 January 1993
0 references
strong chromatic index
0 references
cubic graph
0 references
edge-colouring
0 references
