Partitioning a graph into offensive \(k\)-alliances (Q629362): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57974381, #quickstatements; #temporary_batch_1706974296281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57974381 / rank | |||
Normal rank | |||
Revision as of 17:37, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into offensive \(k\)-alliances |
scientific article |
Statements
Partitioning a graph into offensive \(k\)-alliances (English)
0 references
9 March 2011
0 references
offensive alliances
0 references
dominating sets
0 references
domination number
0 references
chromatic number
0 references
