Partitioning a graph into a cycle and a sparse graph

DOI10.1016/j.disc.2022.113161zbMath1502.05206arXiv1607.03348OpenAlexW2462264393MaRDI QIDQ2092387

Alexey Pokrovskiy

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.03348

zbMATH Keywords

cyclesRamsey theorypartitioning graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10) Density (toughness, etc.) (05C42)

Related Items (5)

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Towards Lehel's conjecture for 4-uniform tight cycles ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monochromatic cycle partitions of graphs with large minimum degree
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• The size Ramsey number of a directed path
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning 3-colored complete graphs into three monochromatic cycles
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Vertex coverings by monochromatic cycles and trees
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles

This page was built for publication: Partitioning a graph into a cycle and a sparse graph