Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints (Q5379812): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1706.07292 / rank | |||
Normal rank | |||
Latest revision as of 02:38, 20 April 2024
scientific article; zbMATH DE number 7066092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints |
scientific article; zbMATH DE number 7066092 |
Statements
Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints (English)
0 references
14 June 2019
0 references
\(C_4\)-free graphs
0 references
degree constraints
0 references
feasible partition
0 references
Stiebitz's theorem
0 references
