Vertex partitions by connected monochromatic \(k\)-regular graphs

DOI10.1006/jctb.1999.1933zbMath1028.05093OpenAlexW2075905937MaRDI QIDQ1569063

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

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1933

zbMATH Keywords

coloring

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

Monochromatic cycle power partitions, An improved bound for the monochromatic cycle partition number, Improved monochromatic loose cycle partitions in hypergraphs, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Minimum degree conditions for monochromatic cycle partitioning, Monochromatic bounded degree subgraph partitions, An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs, Monochromatic cycle partitions of edge-colored graphs, Local colourings and monochromatic partitions in complete bipartite graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Monochromatic square-cycle and square-path partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex coverings by monochromatic cycles and trees
• Partitioning complete bipartite graphs by monochromatic cycles
• Blow-up lemma
• Dense graphs without 3-regular subgraphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles