Partitioning by monochromatic trees

DOI10.1006/JCTB.1996.0065zbMath0861.05018OpenAlexW1978665169MaRDI QIDQ1125948

Yoshiharu Kohayakawa, Penny E. Haxell

Publication date: 23 February 1997

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

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

zbMATH Keywords

partitiontreescycle partition numbermonochromatic treestree partition number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Ramsey theory (05D10) Connectivity (05C40)

Related Items (18)

Generalizations and strengthenings of Ryser's conjecture ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Partitioning complete bipartite graphs by monochromatic cycles ⋮ Monochromatic tree covers and Ramsey numbers for set-coloured graphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Heterochromatic tree partition numbers for complete bipartite graphs ⋮ Vertex partitions of \(r\)-edge-colored graphs ⋮ On the minimum monochromatic or multicolored subgraph partition problems ⋮ Partitioning random graphs into monochromatic components ⋮ The complexity for partitioning graphs by monochromatic trees, cycles and paths ⋮ Highly connected monochromatic subgraphs ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees ⋮ Partitioning complete graphs by heterochromatic trees ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Covering 3-Edge-Colored Random Graphs with Monochromatic Trees

This page was built for publication: Partitioning by monochromatic trees