Monochromatic cycle power partitions
From MaRDI portal
Publication:2374161
DOI10.1016/j.disc.2016.08.009zbMath1351.05088OpenAlexW2516857358MaRDI QIDQ2374161
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.08.009
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
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Monochromatic square-cycle and square-path partitions, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved monochromatic loose cycle partitions in hypergraphs
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- Monochromatic bounded degree subgraph partitions
- Partitioning 3-colored complete graphs into three monochromatic cycles
- An improved bound for the monochromatic cycle partition number
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Vertex coverings by monochromatic cycles and trees
- Proof of the Seymour conjecture for large graphs
- Partitioning complete bipartite graphs by monochromatic cycles
- Blow-up lemma
- Vertex partitions by connected monochromatic \(k\)-regular graphs
- The square of paths and cycles
- Hamiltonian square-paths
- Monochromatic path and cycle partitions in hypergraphs
- Ramsey-goodness -- and otherwise
- Three-color Ramsey numbers for paths
- Monochromatic cycle partitions of edge-colored graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- An algorithmic version of the blow-up lemma
- The Square of a Hamiltonian Cycle
- On the square of a Hamiltonian cycle in dense graphs
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- An Extension of the Blow-up Lemma to Arrangeable Graphs
- Pósa's conjecture for graphs of order at least 2 × 108
