Partitioning a graph into monochromatic connected subgraphs

DOI10.1002/jgt.22435zbMath1417.05166arXiv1708.01284OpenAlexW2963274697MaRDI QIDQ5229539

Julian Sahasrabudhe, António Girão, Shoham Letzter

Publication date: 15 August 2019

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

Full work available at URL: https://arxiv.org/abs/1708.01284

zbMATH Keywords

partitioningcoveringedge coloringsmonochromatic connected subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

Generalizations and strengthenings of Ryser's conjecture ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Large monochromatic components in almost complete graphs and bipartite graphs ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs

This page was built for publication: Partitioning a graph into monochromatic connected subgraphs