Decomposing complete equipartite graphs into odd square-length cycles: number of parts even (Q418858): 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: 05C38 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6039210 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph decomposition | |||
| Property / zbMATH Keywords: graph decomposition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle decomposition | |||
| Property / zbMATH Keywords: cycle decomposition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complete equipartite graph | |||
| Property / zbMATH Keywords: complete equipartite graph / rank | |||
Normal rank | |||
Revision as of 21:13, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing complete equipartite graphs into odd square-length cycles: number of parts even |
scientific article |
Statements
Decomposing complete equipartite graphs into odd square-length cycles: number of parts even (English)
0 references
30 May 2012
0 references
graph decomposition
0 references
cycle decomposition
0 references
complete equipartite graph
0 references
