Partitioning 3-coloured complete graphs into three monochromatic paths
type: Item
instance of: scholarly article
zbMATH Open document ID: 1274.05173
author: Alexey Pokrovskiy
publication date: 2013-11-01T00:00:00Z
full work available at URL: S1571065311001867
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6222091
MaRDI profile type: Publication
cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
cites work: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
cites work: Vertex coverings by monochromatic cycles and trees
cites work: Vertex coverings by monochromatic paths and cycles
cites work: Q3977492
cites work: A Ramsey-type problem in directed and bipartite graphs
cites work: An improved bound for the monochromatic cycle partition number
cites work: Partitioning 3-colored complete graphs into three monochromatic cycles
cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
title: Partitioning 3-coloured complete graphs into three monochromatic paths
description: scientific article; zbMATH DE number 6222091