Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
From MaRDI portal
Recommendations
Cites work
Cited in
(44)- Vertex covering with monochromatic pieces of few colours
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
- Monochromatic square-cycle and square-path partitions
- Partitioning a graph into a cycle and a sparse graph
- Towards Lehel's conjecture for 4-uniform tight cycles
- Partitioning infinite hypergraphs into few monochromatic Berge-paths
- Monochromatic partitions in local edge colorings
- Ramsey-goodness -- and otherwise
- Monochromatic cycle power partitions
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
- Partitioning 3-coloured complete graphs into three monochromatic paths
- Monochromatic cycle partitions of edge-colored graphs
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Monochromatic cycle partitions of graphs with large minimum degree
- Monochromatic cycle partitions in local edge colorings
- 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
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Monochromatic bounded degree subgraph partitions
- Partitioning random graphs into monochromatic components
- Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs
- Partitioning edge-colored hypergraphs into few monochromatic tight cycles
- Local colourings and monochromatic partitions in complete bipartite graphs
- Local colourings and monochromatic partitions in complete bipartite graphs
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles
- Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers
- Ramsey-type problems for tilings in dense graphs
- Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
- Polynomial bounds for monochromatic tight cycle partition in \(r\)-edge-coloured \(K_n^{(k)}\)
- Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles (extended abstract)
- Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
This page was built for publication: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527536)
