Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C07 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6370979 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
iterated random colouring | |||
| Property / zbMATH Keywords: iterated random colouring / rank | |||
Normal rank | |||
Revision as of 17:01, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of bounded degree graphs into \(C_4\)-free subgraphs |
scientific article |
Statements
Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (English)
0 references
19 November 2014
0 references
iterated random colouring
0 references
