On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489)
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: On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs |
scientific article |
Statements
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (English)
0 references
28 December 2016
0 references
closed distinguishing labeling
0 references
list-closed distinguishing labeling
0 references
strong closed distinguishing labeling
0 references
computational complexity
0 references
combinatorial Nullstellensatz
0 references
