dc.contributor.author | Fronček, Dalibor | |
dc.date.accessioned | 2007-09-12T08:04:43Z | |
dc.date.available | 2007-09-12T08:04:43Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | Graphs and Combinatorics. 1996, vol. 12, no. 4, p. 305-320. | en |
dc.identifier.issn | 0911-0119 | |
dc.identifier.issn | 1435-5914 | |
dc.identifier.uri | http://hdl.handle.net/10084/62707 | |
dc.language.iso | en | en |
dc.publisher | Springer | en |
dc.relation.ispartofseries | Graphs and Combinatorics | en |
dc.relation.uri | https://doi.org/10.1007/BF01858463 | en |
dc.subject | graph decompositions | en |
dc.subject | isomorphic factors | en |
dc.subject | selfcomplementary-graphs | en |
dc.title | Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters | en |
dc.type | article | en |
dc.identifier.location | Není ve fondu ÚK | en |
dc.description.abstract-en | We completely determine the spectrum of the complete bipartite and tripartite graphs that are decomposable into two isomorphic factors with a finite diameter. | en |
dc.identifier.doi | 10.1007/BF01858463 | |
dc.identifier.wos | A1996VV68100001 | |