Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

DOI10.1016/j.endm.2015.06.106zbMath1346.05235OpenAlexW2245042726MaRDI QIDQ324372

Richard Lang, Oliver Schaudt, Maya Jakobine Stein

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.106

zbMATH Keywords

complete bipartite graphcomplete graphmonochromatic cycle partitionedge-coloured graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Local colourings and monochromatic partitions in complete bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Partitioning 3-colored complete graphs into three monochromatic cycles
• An improved bound for the monochromatic cycle partition number
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Vertex coverings by monochromatic cycles and trees
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Partitioning complete bipartite graphs by monochromatic cycles
• Blow-up lemma
• Three-color Ramsey numbers for paths
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Holes in graphs
• Local colourings and monochromatic partitions in complete bipartite graphs

This page was built for publication: Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles