Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jctb.2009.07.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCTB.2009.07.001 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 10 December 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
