Decompositions of complete multipartite graphs into disconnected selfcomplementary factors

dc.contributor.author	Fronček, Dalibor
dc.date.accessioned	2007-08-20T12:35:24Z
dc.date.available	2007-08-20T12:35:24Z
dc.date.issued	1998
dc.description.abstract-en	We determine the spectrum of complete bipartite and tripartite graphs that are decomposable into disconnected selfcomplementary factors (isodecomposable). For r-partite graphs with r greater than or equal to 4 we determine the smallest orders of graphs that are isodecomposable. We also prove that every complete r-partite graph with at least one even part is isodecomposable. For graphs with all odd parts we prove that if among the cardinalities of the parts there is exactly one that appears an odd number of times, then the graph is also isodecomposable. Finally, we present a class of graphs with all odd parts that are not isodecomposable.	en
dc.identifier.citation	Utilitas Mathematica. 1998, vol. 53, p. 201-216.	en
dc.identifier.issn	0315-3681
dc.identifier.location	Není ve fondu ÚK	en
dc.identifier.uri	http://hdl.handle.net/10084/62068
dc.identifier.wos	000073902700018
dc.language.iso	en	en
dc.publisher	Utilitas Mathematica	en
dc.relation.ispartofseries	Utilitas Mathematica	en
dc.title	Decompositions of complete multipartite graphs into disconnected selfcomplementary factors	en
dc.type	article	en

Collections