Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
From MaRDI portal
Publication:6621182
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- An improved bound for the monochromatic cycle partition number
- Blow-up lemma
- Vertex coverings by monochromatic cycles and trees
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Monochromatic bounded degree subgraph partitions
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Ramsey numbers of degenerate graphs
- On graphs with linear Ramsey numbers
- Monochromatic cycle power partitions
This page was built for publication: Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621182)
