Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2023.11.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2023.11.001 / rank | |||
Normal rank | |||
Latest revision as of 19:11, 30 December 2024
scientific article; zbMATH DE number 7781866
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning of a graph into induced subgraphs not containing prescribed cliques |
scientific article; zbMATH DE number 7781866 |
Statements
Partitioning of a graph into induced subgraphs not containing prescribed cliques (English)
0 references
22 December 2023
0 references
graph partitioning
0 references
\(G\)-free coloring
0 references
graph coloring
0 references
Borodin-Kostochka conjecture
0 references
0 references
