Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs

DOI10.1016/j.disc.2011.05.031zbMath1228.05239OpenAlexW2145887270MaRDI 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

zbMATH Keywords

vertex partitionsmonochromatic \(k\)-regular subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Local colourings and monochromatic partitions in complete bipartite graphs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs