Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
type: Item
instance of: scholarly article
title: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
zbMATH Open document ID: 1216.05110
published in: Journal of Combinatorial Theory. Series B
publication date: 2010-04-21T00:00:00Z
full work available at URL: lehel.pdf
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5696987
zbMATH Keywords: graph partition
zbMATH Keywords: two-colored complete graph
zbMATH Keywords: cycle decomposition
author: Stéphane Bessy
author: Stéphan Thomassé
MaRDI profile type: Publication
OpenAlex ID: W1964859857
cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
cites work: Vertex coverings by monochromatic cycles and trees
cites work: Vertex coverings by monochromatic paths and cycles
cites work: An improved bound for the monochromatic cycle partition number
cites work: Partitioning complete bipartite graphs by monochromatic cycles
cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
DOI: 10.1016/J.JCTB.2009.07.001
description: scientific article; zbMATH DE number 5696987