Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (Q2827784): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Add wikidata reference. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2964017825 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1409.0650 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129367202 / rank | |||
Normal rank |
Latest revision as of 16:46, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equitable coloring of corona products of cubic graphs is harder than ordinary coloring |
scientific article |
Statements
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring (English)
0 references
21 October 2016
0 references
corona graph
0 references
cubic graph
0 references
equitable chromatic number
0 references
equitable graph coloring
0 references
NP-hardness
0 references
polynomial algorithm
0 references