Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7751504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring a dominating set without conflicts: \(q\)-subset square colouring |
scientific article; zbMATH DE number 7751504 |
Statements
Colouring a dominating set without conflicts: \(q\)-subset square colouring (English)
0 references
17 October 2023
0 references
graph colouring
0 references
square colouring
0 references
subset square colouring
0 references
parameterized algorithm
0 references
dominating set
0 references
0.9949943
0 references
0.86534345
0 references
0 references
0 references
0 references
0.8452798
0 references
0.84510374
0 references
0.8447093
0 references
0 references
