Greedy defining sets of graphs (Q2712526)
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: Greedy defining sets of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy defining sets of graphs |
scientific article |
Statements
6 May 2001
0 references
vertex colouring
0 references
greedy defining set
0 references
blocking set
0 references
vertex cover
0 references
Greedy defining sets of graphs (English)
0 references
It is shown that the greedy defining number is an NP-complete problem. The following question is asked: is the greedy defining number for uncoloured graphs an NP-complete problem?
0 references
