Local colourings and monochromatic partitions in complete bipartite graphs
From MaRDI portal
Publication:5965537
DOI10.1016/j.ejc.2016.09.003zbMath1348.05077OpenAlexW2528975526MaRDI QIDQ5965537
Richard Lang, Maya Jakobine Stein
Publication date: 7 November 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2016.09.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles ⋮ Stability for vertex cycle covers ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Monochromatic partitions in local edge colorings ⋮ Monochromatic square-cycle and square-path partitions ⋮ Monochromatic cycle partitions in random graphs ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
- Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Linear upper bounds for local Ramsey numbers
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Generalized local colorings of graphs
- Path-path Ramsey type numbers for the complete bipartite graph
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Partitioning complete bipartite graphs by monochromatic cycles
- A note on local colorings of graphs
- Vertex partitions by connected monochromatic \(k\)-regular graphs
- Local Ramsey numbers for some graphs
- A Ramsey-type problem in directed and bipartite graphs
- Monochromatic cycle partitions of edge-colored graphs
- Local and meank-Ramsey numbers for complete graphs
- Monochromatic Cycle Partitions in Local Edge Colorings
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS
- Vertex coverings by monochromatic paths and cycles
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Holes in graphs
This page was built for publication: Local colourings and monochromatic partitions in complete bipartite graphs
