Monochromatic cycle partitions of edge-colored graphs (Q3067062): 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: Sharp bounds for some multicolour Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / 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: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex partitions by connected monochromatic \(k\)-regular graphs / rank | |||
Normal rank |
Latest revision as of 17:05, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Monochromatic cycle partitions of edge-colored graphs |
scientific article |
Statements
Monochromatic cycle partitions of edge-colored graphs (English)
0 references
20 January 2011
0 references
monochromatic cycle partitions
0 references
edge-colorings
0 references