The strong chromatic index of a cubic graph is at most 10 (Q1201255): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 12:03, 17 May 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
