Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex coverings by monochromatic cycles and trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex coverings by monochromatic paths and cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved bound for the monochromatic cycle partition number / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank | |||
Normal rank | |||
Revision as of 16:54, 2 July 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
