Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints (Q5379812)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposing C4‐free graphs under degree constraints |
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
