Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246)
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: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture |
scientific article; zbMATH DE number 5696987
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture |
scientific article; zbMATH DE number 5696987 |
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
