An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs

DOI10.1002/jgt.21661zbMath1264.05108OpenAlexW1544552402MaRDI QIDQ4920655

Fei Song, Gábor N. Sárközy, Stanley M. Selkow

Publication date: 21 May 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21661

zbMATH Keywords

vertex partitionsregulatory lemma

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 (8)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ Stability for vertex cycle covers ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Monochromatic bounded degree subgraph partitions ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic square-cycle and square-path partitions

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
• Dense graphs without 3-regular subgraphs
• Three-color Ramsey numbers for paths
• On maximal paths and circuits of graphs
• 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
• Packings in Dense Regular Graphs

This page was built for publication: An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs