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 the normal view instead:
scientific article; zbMATH DE number 5696987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8195871710777283
0 references
0.8087475895881653
0 references
0.8079320788383484
0 references
0.7986646890640259
0 references
