Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges

We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), and k(p + q) = 2mn for k ≡ 0 (mod 2) and also when λ ≥ 3, λm ≡ λn ≡...

Full description

Bibliographic Details
Main Authors: Jeevadoss Shanmugasundaram, Muthusamy Appu
Format: Article
Language:English
Published: Sciendo 2015-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1830