Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
From MaRDI portal
Publication:641170
DOI10.1016/j.disc.2011.05.031zbMath1228.05239MaRDI QIDQ641170
Gábor N. Sárközy, Fei Song, Stanley M. Selkow
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.031
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Vertex coverings by monochromatic cycles and trees
- Partitioning complete bipartite graphs by monochromatic cycles
- Blow-up lemma
- Vertex partitions by connected monochromatic \(k\)-regular graphs
- 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