Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture |
scientific article |
Statements
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (English)
0 references
21 April 2010
0 references
graph partition
0 references
two-colored complete graph
0 references
cycle decomposition
0 references
