Clustered colouring of graph products (Q6925698)
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 8097643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustered colouring of graph products |
scientific article; zbMATH DE number 8097643 |
Statements
Clustered colouring of graph products (English)
0 references
25 September 2025
0 references
Motivated by recent results showing that many natural graph classes are subgraphs of the strong product of a graph with bounded treewidth and a path, this paper studies clustered colouring of strong products of two bounded treewidth graphs, where none, one, or both graphs have bounded degree.
0 references
clustered colouring
0 references
graph products
0 references
