Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
From MaRDI portal
Publication:324372
DOI10.1016/J.ENDM.2015.06.106zbMATH Open1346.05235OpenAlexW2245042726MaRDI QIDQ324372FDOQ324372
Authors: Richard Lang, Oliver Schaudt, Maya Stein 
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.106
Recommendations
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Three-color Ramsey numbers for paths
- An improved bound for the monochromatic cycle partition number
- Blow-up lemma
- Vertex coverings by monochromatic cycles and trees
- Partitioning complete bipartite graphs by monochromatic cycles
- One-sided coverings of colored complete bipartite graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Holes in graphs
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Local colourings and monochromatic partitions in complete bipartite graphs
Cited In (12)
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Triangulations of the sphere, bitrades and abelian groups
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Local colourings and monochromatic partitions in complete bipartite graphs
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
- Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
- Local colourings and monochromatic partitions in complete bipartite graphs
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
- Disjoint properly colored cycles in edge-colored complete bipartite graphs
This page was built for publication: Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324372)
