Partition of graphs and hypergraphs into monochromatic connected parts

zbMath1252.05176MaRDI QIDQ456358

Ágnes Tóth, András Gyárfás, Shinya Fujita, Michitaka Furuya

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p27

zbMATH Keywords

covering of edge colored graphs by monochromatic connected parts

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

Generalizations and strengthenings of Ryser's conjecture ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Covering complete partite hypergraphs by monochromatic components ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Partitioning random graphs into monochromatic components

This page was built for publication: Partition of graphs and hypergraphs into monochromatic connected parts