Decomposing complete equipartite graphs into short odd cycles
type: Item
instance of: scholarly article
title: Decomposing complete equipartite graphs into short odd cycles
zbMATH Open document ID: 1231.05151
author: Benjamin R. Smith
author: Nicholas J. Cavenagh
published in: The Electronic Journal of Combinatorics
publication date: 2010-10-13T00:00:00Z
full work available at URL: https://eudml.org/doc/227311
full work available at URL: v17i1r130.html
review text: Summary: We examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both odd and short relative to the number of parts.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C51
zbMATH DE Number: 5799458
zbMATH Keywords: lexicographic product of a cycle
MaRDI profile type: Publication
Recommended article: Decomposing complete equipartite graphs into short even cycles
Recommended article: Decomposing various graphs into short even-length cycles
Recommended article: Decompositions of complete multipartite graphs into cycles of even length
Recommended article: Decomposing complete equipartite graphs into cycles of length2p
Recommended article: Decomposition of complete bipartite graphs into cycles of distinct even lengths
Recommended article: Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
Recommended article: Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
Recommended article: Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)
Recommended article: Q3190876
Recommended article: Some gregarious cycle decompositions of complete equipartite graphs
description: scientific article; zbMATH DE number 5799458