Monochromatic square-cycle and square-path partitions
From MaRDI portal
Publication:2065889
DOI10.1016/j.disc.2021.112712zbMath1480.05059OpenAlexW3212835461MaRDI QIDQ2065889
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112712
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monochromatic cycle partitions of graphs with large minimum degree
- 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
- Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
- 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
- Monochromatic partitions in local edge colorings
- Minimum degree conditions for monochromatic cycle partitioning
- Ramsey-goodness -- and otherwise
- Monochromatic cycle power partitions
- Three-color Ramsey numbers for paths
- Calculating Ramsey Numbers by Partitioning Colored Graphs
- Monochromatic cycle partitions of edge-colored 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
- 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
- Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles
- Pósa's conjecture for graphs of order at least 2 × 108
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
- Local colourings and monochromatic partitions in complete bipartite graphs
This page was built for publication: Monochromatic square-cycle and square-path partitions
