Monochromatic cycle partitions of edge-colored graphs

DOI10.1002/jgt.20492zbMath1222.05075MaRDI QIDQ3067062

Gábor N. Sárközy

Publication date: 20 January 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20492

zbMATH Keywords

edge-colorings; monochromatic cycle partitions

Mathematics Subject Classification ID

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

Related Items

Local colourings and monochromatic partitions in complete bipartite graphs, Vertex covers by monochromatic pieces -- a survey of results and problems, Improved monochromatic loose cycle partitions in hypergraphs, Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Monochromatic loose-cycle partitions in hypergraphs, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Monochromatic bounded degree subgraph partitions, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Vertex covering with monochromatic pieces of few colours, Monochromatic cycle power partitions, Large monochromatic components in edge colored graphs with a minimum degree condition

Cites Work

• Unnamed Item
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning complete bipartite graphs by monochromatic cycles
• Vertex partitions by connected monochromatic \(k\)-regular graphs
• Sharp bounds for some multicolour Ramsey numbers
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles