Note on the decomposition of λKm,n (λKm,n*) into paths

Mirosław Truszczyński

doi:10.1016/S0012-365X(85)80023-6

Note on the decomposition of λK_m,n (λK_m,n^*) into paths

Mirosław Truszczyński

Computer Science

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λK_m,n^* and a complete bipartite multigraph λK_m,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.

Original language	English
Pages (from-to)	89-96
Number of pages	8
Journal	Discrete Mathematics
Volume	55
Issue number	1
DOIs	https://doi.org/10.1016/S0012-365X(85)80023-6
State	Published - 1985

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(85)80023-6

Cite this

@article{0d83eec1e9db448a8182a6864623d530,

title = "Note on the decomposition of λKm,n (λKm,n*) into paths",

abstract = "In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* and a complete bipartite multigraph λKm,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.",

author = "Miros{\l}aw Truszczy{\'n}ski",

year = "1985",

doi = "10.1016/S0012-365X(85)80023-6",

language = "English",

volume = "55",

pages = "89--96",

number = "1",

}

TY - JOUR

T1 - Note on the decomposition of λKm,n (λKm,n*) into paths

AU - Truszczyński, Mirosław

PY - 1985

Y1 - 1985

N2 - In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* and a complete bipartite multigraph λKm,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.

AB - In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* and a complete bipartite multigraph λKm,n into paths of the same length. We give some necessary and/or sufficient conditions for such a decomposition to exist. We obtain also some results for the case when the paths in a decomposition need not to have equal lengths.

UR - http://www.scopus.com/inward/record.url?scp=14944350666&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=14944350666&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(85)80023-6

DO - 10.1016/S0012-365X(85)80023-6

M3 - Article

AN - SCOPUS:14944350666

SN - 0012-365X

VL - 55

SP - 89

EP - 96

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Note on the decomposition of λK_m,n (λK_m,n^*) into paths

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this