Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (Q4238172): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548398003599 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170028807 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 2024
scientific article; zbMATH DE number 1275755
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles |
scientific article; zbMATH DE number 1275755 |
Statements
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles (English)
0 references
7 July 1999
0 references
two-coloured complete graph
0 references
monochromatic cycle
0 references
regularity lemma
0 references
vertex covering
0 references
