Fast FPT algorithms for Grundy number on dense graphs (Q6969499)
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 8054684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast FPT algorithms for Grundy number on dense graphs |
scientific article; zbMATH DE number 8054684 |
Statements
Fast FPT algorithms for Grundy number on dense graphs (English)
0 references
20 June 2025
0 references
Grundy coloring
0 references
cluster graphs
0 references
max flow
0 references
fixed-parameter tractable (FPT) algorithms
0 references
integer program
0 references
